+/**
+ * \brief Check if the produced graph is connected
+ *
+ * You should check if the produced graph is connected before doing anything
+ * on it. You probably don't want any isolated node or group of nodes...
+ *
+ * \return TRUE if the graph is connected, FALSE otherwise
+ */
+int platf_graph_is_connected(void) {
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_dynar_t connected_nodes = NULL;
+ xbt_dynar_t outgoing_edges = NULL;
+ xbt_node_t graph_node = NULL;
+ context_node_t node_data = 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);
+ node_data = xbt_graph_node_get_data(graph_node);
+ node_data->connect_checked = TRUE;
+ xbt_dynar_push(connected_nodes, &graph_node);
+ iterator = 0;
+ do {
+ //Get the next node
+ xbt_dynar_get_cpy(connected_nodes, iterator, &graph_node);
+ node_data = xbt_graph_node_get_data(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);
+ node_data = xbt_graph_node_get_data(src);
+ if(!node_data->connect_checked) {
+ xbt_dynar_push(connected_nodes, &src);
+ node_data->connect_checked = TRUE;
+ }
+ node_data = xbt_graph_node_get_data(dst);
+ if(!node_data->connect_checked) {
+ xbt_dynar_push(connected_nodes, &dst);
+ node_data->connect_checked = TRUE;
+ }
+ }
+ } while(++iterator < xbt_dynar_length(connected_nodes));
+
+ // The graph is connected if the connected node array has the same length
+ // as the graph node array
+ return xbt_dynar_length(connected_nodes) == xbt_dynar_length(dynar_nodes);
+}
+
+
+/**
+ * \brief Remove the links in the created topology
+ *
+ * This is useful when the created topology is not connected, and you want
+ * to generate a new one.
+ */
+void platf_graph_clear_links(void) {
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_dynar_t dynar_edges = NULL;
+ xbt_dynar_t dynar_edges_cpy = NULL;
+ xbt_node_t graph_node = NULL;
+ xbt_edge_t graph_edge = NULL;
+ context_node_t node_data = NULL;
+ unsigned int i;
+
+ //The graph edge dynar will be modified directly, so we work on a copy of it
+ dynar_edges = xbt_graph_get_edges(platform_graph);
+ dynar_edges_cpy = xbt_dynar_new(sizeof(xbt_edge_t), NULL);
+ xbt_dynar_foreach(dynar_edges, i, graph_edge) {
+ 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) {
+ xbt_graph_free_edge(platform_graph, graph_edge, xbt_free);
+ }
+ //remove the dynar copy
+ xbt_dynar_free(&dynar_edges_cpy);
+
+ //All the nodes will be of degree 0, unchecked from connectedness
+ 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;
+ node_data->connect_checked = FALSE;
+ }
+}
+
+/**
+ * \brief Promote a node to a host
+ *
+ * This function should be called in callbacks registered with the
+ * platf_graph_promoter function.
+ *
+ * \param node The node to promote
+ * \param parameters The parameters needed to build the host
+ */