Add benchmarks for tarjan's SCC algorithm

benches/matrix_graph.rs

@@ -198,11 +198,17 @@ fn full_neighbors_in(bench: &mut Bencher) {
 }
 
 #[bench]
-fn full_sccs(bench: &mut Bencher) {
+fn full_kosaraju_sccs(bench: &mut Bencher) {
     let a = parse_matrix::<Directed>(FULL);
     bench.iter(|| algo::kosaraju_scc(&a));
 }
 
+#[bench]
+fn full_tarjan_sccs(bench: &mut Bencher) {
+    let a = parse_matrix::<Directed>(FULL);
+    bench.iter(|| algo::tarjan_scc(&a));
+}
+
 #[bench]
 fn bigger_edges_out(bench: &mut Bencher) {
     let a = parse_matrix::<Directed>(BIGGER);
@@ -229,7 +235,13 @@ fn bigger_neighbors_in(bench: &mut Bencher) {
 }
 
 #[bench]
-fn bigger_sccs(bench: &mut Bencher) {
+fn bigger_kosaraju_sccs(bench: &mut Bencher) {
     let a = parse_matrix::<Directed>(BIGGER);
     bench.iter(|| algo::kosaraju_scc(&a));
 }
+
+#[bench]
+fn bigger_tarjan_sccs(bench: &mut Bencher) {
+    let a = parse_matrix::<Directed>(BIGGER);
+    bench.iter(|| algo::tarjan_scc(&a));
+}

benches/stable_graph.rs

@@ -49,17 +49,29 @@ fn neighbors_in(bench: &mut Bencher) {
 }
 
 #[bench]
-fn sccs_stable_graph(bench: &mut Bencher) {
+fn sccs_kosaraju_stable_graph(bench: &mut Bencher) {
     let a = stable_digraph().bigger();
     bench.iter(|| petgraph::algo::kosaraju_scc(&a));
 }
 
 #[bench]
-fn sccs_graph(bench: &mut Bencher) {
+fn sccs_kosaraju_graph(bench: &mut Bencher) {
     let a = digraph().bigger();
     bench.iter(|| petgraph::algo::kosaraju_scc(&a));
 }
 
+#[bench]
+fn sccs_tarjan_stable_graph(bench: &mut Bencher) {
+    let a = stable_digraph().bigger();
+    bench.iter(|| petgraph::algo::tarjan_scc(&a));
+}
+
+#[bench]
+fn sccs_tarjan_graph(bench: &mut Bencher) {
+    let a = digraph().bigger();
+    bench.iter(|| petgraph::algo::tarjan_scc(&a));
+}
+
 #[bench]
 fn stable_graph_map(bench: &mut Bencher) {
     let a = stable_digraph().bigger();