hub / github.com/djeada/Algorithms-And-Data-Structures / dfs

Function dfs

src/graphs/python/dfs/src/dfs.py:10–50 · view source on GitHub ↗

Find a path between source and destination using DFS. Note: DFS does not guarantee the shortest path. For shortest paths, use BFS (unweighted) or Dijkstra/Bellman-Ford (weighted). Args: graph: The graph to search. source: The starting vertex. desti

(graph: Graph, source: Vertex, destination: Vertex)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 3

test_dfs_str_vertices_negativeMethod · 0.90

test_dfs_int_vertices_positiveMethod · 0.90

test_dfs_int_vertices_negativeMethod · 0.90

Calls 3

searchFunction · 0.70

containsMethod · 0.45

verticesMethod · 0.45

Tested by 3

test_dfs_str_vertices_negativeMethod · 0.72

test_dfs_int_vertices_positiveMethod · 0.72

test_dfs_int_vertices_negativeMethod · 0.72