/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
+#ifdef __BORLANDC__
+ #pragma hdrstop
+ #endif
+
+#include <stdio.h>
+
+#ifdef _MSC_VER
+#define snprintf _snprintf
+#endif
#include "xbt/module.h"
#include "xbt/sysdep.h"
int test_shortest_paths = 1;
int test_topo_sort = 1;
- int i, j;
+ unsigned long i, j;
unsigned long n;
xbt_dynar_t edges = NULL;
sorted = xbt_graph_topo_sort(graph);
for (i = 0; i < n; i++) {
if (sorted[i]) {
- INFO3("sorted[%d] = %s (%p)", i, node_name(sorted[i]), sorted[i]);
+ INFO3("sorted[%lu] = %s (%p)", i, node_name(sorted[i]), sorted[i]);
}
}
free(sorted);
xbt_graph_free_graph(graph, free_label, NULL, NULL);
}
+#ifdef __BORLANDC__
+#pragma argsused
+#endif
+
int main(int argc, char **argv) {
xbt_init(&argc, argv);
if (argc == 1) {