+/**
+ * \brief Create a topology where the probability follows the model of Waxman
+ *
+ * see Waxman, Routing of Multipoint Connections, IEEE J. on Selected Areas in Comm., 1988
+ *
+ * \param alpha Number of edges increases with alpha
+ * \param beta Edge length heterogeneity increases with beta
+ */
+void platf_graph_interconnect_waxman(double alpha, double beta) {
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t first_node = NULL;
+ xbt_node_t second_node = NULL;
+ unsigned int i,j;
+ double L = sqrt(2.0); /* L = c*sqrt(2); c=side of placement square */
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, first_node) {
+ xbt_dynar_foreach(dynar_nodes, j, second_node) {
+ if(j>=i)
+ break;
+ double d = platf_node_distance(first_node, second_node);
+ if(RngStream_RandU01(rng_stream) < alpha*exp(-d/(L*beta))) {
+ platf_node_connect(first_node, second_node);
+ }
+ }
+ }
+}
+
+/**
+ * \brief Create a topology where the probability follows the model of Zegura
+ * see Zegura, Calvert, Donahoo, A quantitative comparison of graph-based models
+ * for Internet topology, IEEE/ACM Transactions on Networking, 1997.
+ *
+ * \param alpha Probability of connexion for short edges
+ * \param beta Probability of connexion for long edges
+ * \param r Limit between long and short edges (between 0 and sqrt(2) since nodes are placed on the unit square)
+ */
+void platf_graph_interconnect_zegura(double alpha, double beta, double r) {
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t first_node = NULL;
+ xbt_node_t second_node = NULL;
+ unsigned int i,j;
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, first_node) {
+ xbt_dynar_foreach(dynar_nodes, j, second_node) {
+ if(j>=i)
+ break;
+ double d = platf_node_distance(first_node, second_node);
+ double proba = d < r ? alpha : beta;
+ if(RngStream_RandU01(rng_stream) < proba) {
+ platf_node_connect(first_node, second_node);
+ }
+ }
+ }
+}
+
+/**
+ * \brief Create a topology constructed according to the Barabasi-Albert algorithm (follows power laws)
+ * see Barabasi and Albert, Emergence of scaling in random networks, Science 1999, num 59, p509-512.
+ */
+void platf_graph_interconnect_barabasi(void) {
+ xbt_dynar_t dynar_nodes = NULL;
+ xbt_node_t first_node = NULL;
+ xbt_node_t second_node = NULL;
+ context_node_t node_data = NULL;
+ unsigned int i,j;
+ unsigned long sum = 0;
+ dynar_nodes = xbt_graph_get_nodes(platform_graph);
+ xbt_dynar_foreach(dynar_nodes, i, first_node) {
+ xbt_dynar_foreach(dynar_nodes, j, second_node) {
+ if(j>=i)
+ break;
+ node_data = xbt_graph_node_get_data(second_node);
+ if(sum==0 || RngStream_RandU01(rng_stream) < ((double)(node_data->degree)/ (double)sum)) {
+ platf_node_connect(first_node, second_node);
+ sum += 2;
+ }
+ }
+ }
+}
+
+/**
+ * \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
+ */
+void platf_graph_promote_to_host(context_node_t node, sg_platf_host_cbarg_t parameters) {
+ node->kind = HOST;
+ memcpy(&(node->host_parameters), parameters, sizeof(s_sg_platf_host_cbarg_t));
+}
+
+/**
+ * \brief Promote a node to a cluster
+ *
+ * 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 cluster
+ */
+void platf_graph_promote_to_cluster(context_node_t node, sg_platf_cluster_cbarg_t parameters) {
+ node->kind = CLUSTER;
+ memcpy(&(node->cluster_parameters), parameters, sizeof(s_sg_platf_cluster_cbarg_t));
+}
+
+/**
+ * \brief Set the parameters of a network link.
+ *
+ * This function should be called in callbacks registered with the
+ * platf_graph_labeler function.
+ *
+ * \param edge The edge to modify
+ * \param parameters The parameters of the network link
+ */
+void platf_graph_link_label(context_edge_t edge, sg_platf_link_cbarg_t parameters) {
+ memcpy(&(edge->link_parameters), parameters, sizeof(s_sg_platf_link_cbarg_t));
+ edge->labeled = TRUE;
+}
+
+/**
+ * \brief Register a callback to promote nodes
+ *
+ * The best way to promote nodes into host or cluster is to write a function
+ * which takes one parameter, a #context_node_t, make every needed test on
+ * it, and call platf_graph_promote_to_host or platf_graph_promote_to_cluster
+ * if needed. Then, register the function with this one.
+ * You can register several callbacks: the first registered function will be
+ * called first. If the node have not been promoted yet, the second function
+ * will be called, and so on...
+ *
+ * \param promoter_callback The callback function
+ */
+void platf_graph_promoter(platf_promoter_cb_t promoter_callback) {
+ if(promoter_dynar == NULL) {
+ promoter_dynar = xbt_dynar_new(sizeof(platf_promoter_cb_t), NULL);
+ }
+ xbt_dynar_push(promoter_dynar, &promoter_callback);