MCPcopy Create free account
hub / github.com/douchuan/algorithm / dfs

Function dfs

tests/test_shortest_paths.rs:38–43  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

36
37#[test]
38fn dfs() {
39 let i = TINY_EWD;
40 let graph = create_graph(i);
41 let order = DepthFirstOrders::from(graph.as_ref());
42 assert!(order.check().is_ok());
43}
44
45#[test]
46fn cycle() {

Callers

nothing calls this directly

Calls 1

create_graphFunction · 0.70

Tested by

no test coverage detected