-
-
-
/* $Id$ */
-
/* a generic graph library. */
-/* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand.
- All rights reserved. */
+/* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand. */
+ * All rights reserved. */
/* 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. */
return r;
}
-
static xbt_graph_t parsed_graph = NULL;
static xbt_dict_t parsed_nodes = NULL;
static void __parse_node(void)
{
xbt_node_t node =
- xbt_graph_new_node(parsed_graph, (void *) A_graphxml_node_name);
+ xbt_graph_new_node(parsed_graph, NULL);
xbt_dict_set(parsed_nodes, A_graphxml_node_name, (void *) node, NULL);
}
static void __parse_edge(void)
{
- xbt_edge_t edge = xbt_graph_new_edge(parsed_graph,
- xbt_dict_get(parsed_nodes,
- A_graphxml_edge_source),
- xbt_dict_get(parsed_nodes,
- A_graphxml_edge_target),
- (void *) A_graphxml_edge_name);
+ xbt_edge_t edge =
+ xbt_graph_new_edge(parsed_graph,
+ xbt_dict_get(parsed_nodes,A_graphxml_edge_source),
+ xbt_dict_get(parsed_nodes,A_graphxml_edge_target),
+ NULL);
xbt_graph_edge_set_length(edge, atof(A_graphxml_edge_length));