Function main

code/code/graph_algorithms/src/depth_first_search/dfs.go:93–108 · view source on GitHub ↗

************************************** * Tests **************************************/ Test the dfs algorithm on this graph: 1 \ \ 2 5 \ / \ 3 - 4 6 7 Should output: 1 2 3 4 5 6 7, OR SIMILAR (example: 1 2 4 3 5 7 6) NOTE: the output order may vary because we used a for range loop, and

()

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 4

createGraphFunction · 0.70

dfsFunction · 0.70

addEdgeMethod · 0.45

PrintMethod · 0.45

Tested by

no test coverage detected