MCPcopy Create free account
hub / github.com/HarshCasper/NeoAlgo / ModifiedDFS

Method ModifiedDFS

C-Sharp/graphs/TopologicalSorting.cs:35–49  ·  view source on GitHub ↗

Modified DFS algorithm to traverse the graph

(int v, bool[] visited, Stack<int> stack)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 1

PushMethod · 0.80

Tested by

no test coverage detected