def opgD(f, s, g, u, d): g = Graph() #opretter alle hjørner for i in range(1, f): g.insert_vertex(i) #indsætter kanter myVertices = list(g.vertices()) for i in range(1, f, u): g.insert_edge(i, myVertices)
def build_graph(routes): G = Graph() for r in routes: # r = [a, b, c], a & b: Vertices, c: int edge label. a1 = r[0] a2 = r[1] c = r[2] v1 = Vertex(a1) v2 = Vertex(a2) vertices = list(G.vertices()) if vertices: found_v1 = False found_v2 = False v1_str = v1.__str__() v2_str = v2.__str__() for v in vertices: v_str = v.__str__() if v_str == v1_str: found_v1 = True va = v elif v_str == v2_str: found_v2 = True vb = v else: continue if not found_v1: va = G.insert_vertex(a1) if not found_v2: vb = G.insert_vertex(a2) else: va = G.insert_vertex(a1) vb = G.insert_vertex(a2) G.insert_edge(c, va, vb) return G
def _findResidualNetwork(self): graph = self._graph residualGraph = Graph() residualGraph._source = graph.source residualGraph._sink = graph.sink # laver en residual edge re med en eksra attribut cf, som indeholder # hvor meget mere flow denne edge kan tage for v in graph.vertices(): residualGraph.insert_vertex(v) print("***Residualnetwork edges before***") for e in graph.edges(): #re == residual edge re = Vertex(e.element()) re.cf = e.capacity() - e.element() residualGraph.insert_edge(e.element(), e.capacity(), e.vertexFrom(), e.vertexTo()) print("e.element: ", e.element(), "e.capacity: ", e.capacity()) print("re.cf ", re.cf) return residualGraph
def RobotOnAGrid(num, maze): graph = Graph() graph.setEnd(str(len(maze) - 1) + " " + maze[len(maze) - 1]) graph.setStart(str(0) + " " + maze[0]) v1 = None v3 = None v2 = None dfs = dfs_iterator() #Laver knuder for alle "," tegene i mazeen for i in range(len(maze)): #Skifter linje if i % 4 == 0 and i != 0: pass #Tilføjer knuder til højre elif maze[i] != '#' and maze[i + 1] != '#': v1 = graph.insert_vertex(str(i) + " " + str(maze[i])) v2 = graph.insert_vertex(str(i) + " " + str(maze[i + 1])) graph.insert_edge("R", v1, v2) #Tilføj knuder ned af elif maze[i + 5] != '#' and maze[i + num] != None: v3 = graph.insert_vertex(str(i) + " " + str(maze[i + num])) graph.insert_edge("D", v1, v3) #tilføj knuder til venstre elif maze[i] != '#' and maze[i - 1] != '#' and maze[i - 1] != None: v1 = graph.insert_vertex(str(i) + " " + str(maze[i])) v2 = graph.insert_vertex(str(i) + " " + str(maze[i + 1])) graph.insert_edge("L", v2, v1) #tilføj knuder op af elif maze[i] != '#' and maze[i - num] != None: v3 = graph.insert_vertex(str(i) + " " + str(maze[i - num])) graph.insert_edge("U", v3, v1) return dfs.DFS(graph)
def _merege(A, B): if len(A) > len(B): biggest = A smallest = B else: biggest = B smallest = A for i in range(len(smallest)): biggest.append(smallest[i]) smallest.pop(i) g = Graph() v15 = g.insert_vertex(15) v6 = g.insert_vertex(6) v38 = g.insert_vertex(38) v123 = g.insert_vertex(123) v66 = g.insert_vertex(66) g.insert_edge(10, v15, v38) g.insert_edge(23, v15, v6) g.insert_edge(90, v15, v66) g.insert_edge(8, v66, v6) g.insert_edge(2, v66, v38) g.insert_edge(76, v66, v123) g.insert_edge(7, v123, v6) g.insert_edge(55, v123, v38)
for u in g.edges(): self._unexploredE.append(u) print("Unexplored edge:") for i in self._unexploredE: print(i) print("Unexplored vertex") for i in self._unexploredV: print(i) for u in self._unexploredV: self._DFS(g, u) g = Graph() v15 = g.insert_vertex(15) v6 = g.insert_vertex(6) v38 = g.insert_vertex(38) v123 = g.insert_vertex(123) v66 = g.insert_vertex(66) g.insert_edge(10, v15, v38) g.insert_edge(23, v15, v6) g.insert_edge(90, v15, v66) g.insert_edge(8, v66, v6) g.insert_edge(2, v66, v38) g.insert_edge(76, v66, v123) g.insert_edge(7, v123, v6) g.insert_edge(55, v123, v38)