MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / dfs

Function dfs

graph/depth_first_search_with_stack.cpp:87–115  ·  view source on GitHub ↗

* * @brief * Explores the given vertex, exploring a vertex means traversing * over all the vertices which are connected to the vertex that is * currently being explored and push it onto the stack. * * @param adj graph * @param start starting vertex for DFS * @return vector with nodes stored in the order of DFS traversal * */

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

testsFunction · 0.70
mainFunction · 0.70

Calls 6

push_backMethod · 0.80
sizeMethod · 0.45
pushMethod · 0.45
emptyMethod · 0.45
topMethod · 0.45
popMethod · 0.45

Tested by

no test coverage detected