struct error_graph eg;
struct traversal1_graph t1g;
struct shortcut1_graph s1g;
+ struct shortcut2_graph s2g;
- plan_tests(2 + 7 + 35 + 30 + 30 + 42 + 9 + 30 + 9);
+ plan_tests(2 + 7 + 35 + 30 + 30 + 42 + 9 + 30 + 9 + 9);
trivial_graph_init(&tg);
test_adjacency("trivial", &tg.sg, trivial_adjacency);
shortcut1_graph_init(&s1g);
test_adjacency("shortcut1 graph", &s1g.sg, shortcut1_adjacency);
+ shortcut2_graph_init(&s2g);
+ test_adjacency("shortcut2 graph", &s2g.sg, shortcut2_adjacency);
+
return exit_status();
}