()
| 105 | /// An empty graph should have no SCCs. |
| 106 | #[test] |
| 107 | fn empty() { |
| 108 | let graph = TestGraph::new(&[]); |
| 109 | let sccs: Sccs = Tarjan::new(&graph).run(); |
| 110 | assert_eq!(sccs.node_count(), 0); |
| 111 | } |
| 112 | |
| 113 | /// Tests SCC detection on a simple diamond-shaped DAG. |
| 114 | /// Each node forms its own SCC since there are no cycles. |
no test coverage detected