- dynar = xbt_graph_get_nodes(graph);
-
-
- while(xbt_dynar_length(dynar))
- xbt_graph_free_node(graph,*((xbt_node_t*)xbt_dynar_get_ptr(dynar,0)),NULL,NULL);
-
- dynar = xbt_graph_get_edges(graph);
- printf("%lu edges\n",xbt_dynar_length(dynar));
- dynar1 = xbt_graph_get_nodes(graph);
- printf("%lu nodes\n",xbt_dynar_length(dynar1));
-/* free(d); */
- xbt_graph_free_graph(graph, NULL, NULL, NULL);
+ free(buf);
+ free(adj);
+ }
+
+ if (test_shortest_paths) {
+ char *buf = NULL;
+ xbt_node_t *route = NULL;
+
+ XBT_INFO("---- Testing Shortest Paths ----");
+ route = xbt_graph_shortest_paths(graph);
+ buf = xbt_new0(char, n * 40);
+ for (i = 0; i < n; i++) {
+ for (j = 0; j < n; j++) {
+ if (route[i * n + j])
+ snprintf(buf + strlen(buf), 40, "%s\t",
+ node_name(route[i * n + j]));
+ }
+ XBT_INFO("%s", buf);
+ buf[0] = '\000';
+ }
+ free(buf);
+ free(route);
+ }
+
+ if (test_topo_sort) {
+ xbt_node_t *sorted = NULL;
+
+ XBT_INFO("---- Testing Topological Sort ----");
+ sorted = xbt_graph_topo_sort(graph);
+ for (i = 0; i < n; i++) {
+ if (sorted[i]) {
+ XBT_INFO("sorted[%lu] = %s (%p)", i, node_name(sorted[i]), sorted[i]);
+ }
+ }
+ free(sorted);
+ }
+
+
+ if (test_node_deletion) {
+ XBT_INFO("---- Testing Node Deletion ----");
+ nodes = xbt_graph_get_nodes(graph);
+ edges = xbt_graph_get_edges(graph);
+ XBT_INFO("Before Node deletion: %lu nodes, %lu edges",
+ xbt_dynar_length(nodes), xbt_dynar_length(edges));
+
+ while (!xbt_dynar_is_empty(nodes))
+ xbt_graph_free_node(graph,
+ *((xbt_node_t *) xbt_dynar_get_ptr(nodes, 0)),
+ free_label, NULL);
+ XBT_INFO("After Node deletion: %lu nodes, %lu edges",
+ xbt_dynar_length(nodes), xbt_dynar_length(edges));
+ }
+
+ if (test_edge_deletion) {
+ XBT_INFO("---- Testing Edge Deletion ----");
+ nodes = xbt_graph_get_nodes(graph);
+ edges = xbt_graph_get_edges(graph);
+ XBT_INFO("Before Edge deletion: %lu nodes, %lu edges",
+ xbt_dynar_length(nodes), xbt_dynar_length(edges));
+
+ while (!xbt_dynar_is_empty(edges))
+ xbt_graph_free_edge(graph,
+ *((xbt_edge_t *) xbt_dynar_get_ptr(edges, 0)),
+ NULL);
+
+ XBT_INFO("After Edge deletion: %lu nodes, %lu edges",
+ xbt_dynar_length(nodes), xbt_dynar_length(edges));
+ }
+
+ xbt_graph_free_graph(graph, free_label, NULL, NULL);
+