dynar_nodes = xbt_graph_get_nodes(platform_graph);
xbt_dynar_foreach(dynar_nodes, i, first_node) {
xbt_dynar_foreach(dynar_nodes, j, second_node) {
dynar_nodes = xbt_graph_get_nodes(platform_graph);
xbt_dynar_foreach(dynar_nodes, i, first_node) {
xbt_dynar_foreach(dynar_nodes, j, second_node) {
xbt_dynar_t connected_nodes = NULL;
xbt_dynar_t outgoing_edges = NULL;
xbt_node_t graph_node = NULL;
xbt_dynar_t connected_nodes = NULL;
xbt_dynar_t outgoing_edges = NULL;
xbt_node_t graph_node = NULL;
xbt_edge_t outedge = NULL;
unsigned long iterator;
unsigned int i;
dynar_nodes = xbt_graph_get_nodes(platform_graph);
connected_nodes = xbt_dynar_new(sizeof(xbt_node_t), NULL);
xbt_edge_t outedge = NULL;
unsigned long iterator;
unsigned int i;
dynar_nodes = xbt_graph_get_nodes(platform_graph);
connected_nodes = xbt_dynar_new(sizeof(xbt_node_t), NULL);
+ //Let's just check if every nodes are connected to something
+ xbt_dynar_foreach(dynar_nodes, i, graph_node) {
+ node_data = xbt_graph_node_get_data(graph_node);
+ if(node_data->degree==0) {
+ return FALSE;
+ }
+ }
+
+ //We still need a real check
//Initialize the connected node array with the first node
xbt_dynar_get_cpy(dynar_nodes, 0, &graph_node);
//Initialize the connected node array with the first node
xbt_dynar_get_cpy(dynar_nodes, 0, &graph_node);
xbt_dynar_push(connected_nodes, &graph_node);
iterator = 0;
do {
//Get the next node
xbt_dynar_get_cpy(connected_nodes, iterator, &graph_node);
xbt_dynar_push(connected_nodes, &graph_node);
iterator = 0;
do {
//Get the next node
xbt_dynar_get_cpy(connected_nodes, iterator, &graph_node);
//add all the linked nodes to the connected node array
outgoing_edges = xbt_graph_node_get_outedges(graph_node);
xbt_dynar_foreach(outgoing_edges, i, outedge) {
xbt_node_t src = xbt_graph_edge_get_source(outedge);
xbt_node_t dst = xbt_graph_edge_get_target(outedge);
//add all the linked nodes to the connected node array
outgoing_edges = xbt_graph_node_get_outedges(graph_node);
xbt_dynar_foreach(outgoing_edges, i, outedge) {
xbt_node_t src = xbt_graph_edge_get_source(outedge);
xbt_node_t dst = xbt_graph_edge_get_target(outedge);
void platf_graph_clear_links(void) {
xbt_dynar_t dynar_nodes = NULL;
xbt_dynar_t dynar_edges = NULL;
void platf_graph_clear_links(void) {
xbt_dynar_t dynar_nodes = NULL;
xbt_dynar_t dynar_edges = NULL;
xbt_node_t graph_node = NULL;
xbt_edge_t graph_edge = NULL;
context_node_t node_data = NULL;
unsigned int i;
xbt_node_t graph_node = NULL;
xbt_edge_t graph_edge = NULL;
context_node_t node_data = NULL;
unsigned int i;
+ xbt_dynar_push_as(dynar_edges_cpy, xbt_edge_t, graph_edge);
+ }
+ //Delete edges from the graph
+ xbt_dynar_foreach(dynar_edges_cpy, i, graph_edge) {
dynar_nodes = xbt_graph_get_nodes(platform_graph);
xbt_dynar_foreach(dynar_nodes, i, graph_node) {
node_data = xbt_graph_node_get_data(graph_node);
node_data->degree = 0;
dynar_nodes = xbt_graph_get_nodes(platform_graph);
xbt_dynar_foreach(dynar_nodes, i, graph_node) {
node_data = xbt_graph_node_get_data(graph_node);
node_data->degree = 0;
-
- sg_platf_new_AS_begin("random platform", A_surfxml_AS_routing_Floyd);
+ s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
+ AS.id = "random platform";
+ AS.routing = A_surfxml_AS_routing_Floyd;
+ sg_platf_new_AS_begin(&AS);
//Generate hosts, clusters and routers
xbt_dynar_foreach(nodes, i, graph_node) {
//Generate hosts, clusters and routers
xbt_dynar_foreach(nodes, i, graph_node) {