Add files via upload

Author: ivanmmarkovic

Breadth First Search/Graph.py

@@ -0,0 +1,56 @@
+from Vertex import Vertex
+from Queue import Queue
+
+class Graph:
+    def __init__(self, maxNumberOfVertices = 0):
+        self.maxNumberOfVertices = maxNumberOfVertices
+        self.vertices = [None] * maxNumberOfVertices
+        self.currentNumberOfVertices = 0
+        self.adjacencyMatrix = [[0 for x in range(maxNumberOfVertices)] for y in range(maxNumberOfVertices)]
+
+    def addVertex(self, label):
+        vertex = Vertex(label, self.currentNumberOfVertices)
+        self.vertices[self.currentNumberOfVertices] = vertex
+        self.adjacencyMatrix[self.currentNumberOfVertices][self.currentNumberOfVertices] = False
+        self.currentNumberOfVertices += 1
+
+    def addEdge(self, start, end):
+        self.adjacencyMatrix[start][end] = True
+        self.adjacencyMatrix[end][start] = True
+
+    def breadthFirstSearch(self):
+        queue = Queue()
+        v1 = self.vertices[0]
+        print("Visited : " + v1.label)
+        for j in range(self.currentNumberOfVertices):
+            if self.adjacencyMatrix[v1.index][j] == True:
+                self.vertices[j].inserted = True
+                queue.enqueue(self.vertices[j])
+        v1.visited = True
+        while not queue.isEmpty():
+            vertex = queue.dequeue()
+            vertex.visited = True
+            print("Visited : " + vertex.label)
+            for j in range(self.currentNumberOfVertices):
+                if self.adjacencyMatrix[vertex.index][j] == True and self.vertices[j].visited == False and self.vertices[j].inserted == False:
+                    self.vertices[j].inserted = True
+                    queue.enqueue(self.vertices[j])
+
+
+graph = Graph(10)
+
+graph.addVertex("A")
+graph.addVertex("B")
+graph.addVertex("C")
+graph.addVertex("D")
+graph.addVertex("E")
+
+graph.addEdge(0, 1) # AB
+graph.addEdge(0, 2) # AC
+graph.addEdge(0, 3) # AD
+graph.addEdge(1, 2) # BC
+graph.addEdge(2, 1) # CB
+graph.addEdge(2, 4) # CE
+graph.addEdge(3, 4) # DE
+
+graph.breadthFirstSearch()

Breadth First Search/Node.py

@@ -0,0 +1,5 @@
+
+class Node:
+    def __init__(self, payload = None, next = None):
+        self.payload = payload
+        self.next = next

Breadth First Search/Queue.py

@@ -0,0 +1,29 @@
+from Node import Node
+
+class Queue:
+    def __init__(self, head = None, tail = None):
+        self.head = head
+        self.tail = tail
+
+    def isEmpty(self):
+        return self.head == None
+
+    def enqueue(self, vertex):
+        self.head = Node(vertex, self.head)
+        if self.tail == None:
+            self.tail = self.head
+
+    def dequeue(self):
+        if self.isEmpty():
+            return None
+        else:
+            toReturn = self.tail
+            if self.head == self.tail:
+                self.head = self.tail = None
+            else:
+                tmp = self.head
+                while tmp.next != self.tail:
+                    tmp = tmp.next
+                self.tail = tmp
+                tmp.next = None
+            return toReturn.payload

Breadth First Search/Vertex.py

@@ -0,0 +1,6 @@
+class Vertex:
+    def __init__(self, label = None, index = None):
+        self.label = label
+        self.index = index
+        self.visited = False
+        self.inserted = False