prg_djk Code Sample
#include <stdlib.h>
#include <opnet.h>
#include <prg.h>
#include <prg_vector.h>
#include <prg_graph.h>
#include <prg_djk.h>
#define EXAMPLE_NAMESPACE "example_namespace"
#define EXAMPLE_STATE "example_state"
void
prg_djk_example_code ()
{
int i, vsize;
PrgT_Graph_State_ID state_id;
PrgT_Graph *graph_ptr;
PrgT_Graph_Vertex *vtx_a_ptr, *vtx_b_ptr;
PrgT_Graph_Vertex *vtx_c_ptr, *vtx_d_ptr;
PrgT_Graph_Edge *edge_ab_ptr, *edge_bd_ptr;
PrgT_Graph_Edge *edge_ac_ptr, *edge_cd_ptr;
PrgT_Graph_Edge *edge_ptr;
PrgT_Vector *path_set_vptr, *path_vptr;
PrgT_Compcode status;
FIN (prg_djk_example_code (void));
state_id = prg_graph_state_handler_register (EXAMPLE_NAMESPACE,
EXAMPLE_STATE, PRGC_NIL, PRGC_NIL);
if (state_id == PRGC_GRAPH_INVALID_ID)
FOUT;
graph_ptr = prg_graph_create (EXAMPLE_NAMESPACE);
vtx_a_ptr = prg_graph_vertex_insert (graph_ptr);
vtx_b_ptr = prg_graph_vertex_insert (graph_ptr);
vtx_c_ptr = prg_graph_vertex_insert (graph_ptr);
vtx_d_ptr = prg_graph_vertex_insert (graph_ptr);
edge_ab_ptr = prg_graph_edge_insert (graph_ptr, vtx_a_ptr,
vtx_b_ptr, PrgC_Graph_Edge_Duplex);
edge_ac_ptr = prg_graph_edge_insert (graph_ptr, vtx_a_ptr,
vtx_c_ptr, PrgC_Graph_Edge_Duplex);
edge_bd_ptr = prg_graph_edge_insert (graph_ptr, vtx_b_ptr,
vtx_d_ptr, PrgC_Graph_Edge_Duplex);
edge_cd_ptr = prg_graph_edge_insert (graph_ptr, vtx_c_ptr,
vtx_d_ptr, PrgC_Graph_Edge_Duplex);
status = prg_djk_graph_init (graph_ptr);
if (status == PrgC_Compcode_Failure)
{ prg_graph_destroy (graph_ptr, PRGC_TRUE); FOUT; }
prg_djk_edge_weight_set (edge_ab_ptr, 1);
prg_djk_edge_weight_set (edge_ac_ptr, 2);
prg_djk_edge_weight_set (edge_bd_ptr, 2);
prg_djk_edge_weight_set (edge_cd_ptr, 1);
printf ("\nExample 1:\n");
path_set_vptr = prg_djk_path_get (vtx_a_ptr, vtx_b_ptr);
printf ("Path set contains %d path(s).\n", prg_vector_size (path_set_vptr));
path_vptr = (PrgT_Vector *) prg_vector_access (path_set_vptr, 0);
printf ("Path vector contains %d edge(s).\n", prg_vector_size (path_vptr));
edge_ptr = (PrgT_Graph_Edge *) prg_vector_access (path_vptr, 0);
printf ("Path's edge is%s edge_ab_ptr\n",
(edge_ptr == edge_ab_ptr) ? "" : " not");
prg_vector_destroy (path_vptr, PRGC_FALSE);
prg_vector_destroy (path_set_vptr, PRGC_FALSE);
printf ("\nExample 2:\n");
status = prg_djk_all_sources_compute (graph_ptr);
if (status == PrgC_Compcode_Failure)
{ prg_graph_destroy (graph_ptr, PRGC_TRUE); FOUT;}
printf("The total cost of the shortest path between A and D is: %f\n",
prg_djk_path_cost_get (vtx_a_ptr, vtx_d_ptr));
path_set_vptr = prg_djk_path_get (vtx_a_ptr, vtx_d_ptr);
printf ("Path set contains %d path(s).\n", prg_vector_size (path_set_vptr));
if (prg_vector_size (path_set_vptr) != 2)
{
prg_vector_destroy (path_set_vptr, PRGC_TRUE);
prg_graph_destroy (graph_ptr, PRGC_TRUE);
FOUT;
}
printf ("Displaying path:\n", prg_vector_size (path_set_vptr));
path_vptr = prg_vector_access (path_set_vptr, 1);
vsize = prg_vector_size (path_vptr);
for (i=0; i< vsize; i++)
{
PrgT_Graph_Edge *edge_ptr =
(PrgT_Graph_Edge *) prg_vector_access (path_vptr, i);
printf ("\tEdge address: (%lx)\n", (long) edge_ptr);
}
vsize = prg_vector_size (path_set_vptr);
for (i=0; i< vsize; i++)
{
PrgT_Vector *vptr = (PrgT_Vector *) prg_vector_access (path_set_vptr, i);
prg_vector_destroy (vptr, PRGC_FALSE);
}
prg_vector_destroy (path_set_vptr, PRGC_FALSE);
prg_graph_destroy (graph_ptr, PRGC_TRUE);
FOUT;
}