MCPcopy
hub / github.com/jwasham/practice-python / get_vertex

Method get_vertex

graphs/directed_graph_list.py:24–30  ·  view source on GitHub ↗

Generator for returning the next vertex from the adjacency list :return:

(self)

Source from the content-addressed store, hash-verified

22 self.adjacency_list[source].add(destination)
23
24 def get_vertex(self):
25 """
26 Generator for returning the next vertex from the adjacency list
27 :return:
28 """
29 for v in self.adjacency_list:
30 yield v
31
32 def get_neighbor(self, vertex):
33 """

Callers 5

dfsMethod · 0.95
bfsMethod · 0.95
contains_cycleMethod · 0.95
topological_sortMethod · 0.95
scc_dfs_forward_passMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected