prg_djk_shortest_maximally_edge_disjoint_cycle_compute()
Note: Requires OPNET Development Kit
Abstract
Finds two paths from a source to a destination that have a minimal number of edges in common.
Syntax
prg_djk_shortest_maximally_edge_disjoint_cycle_compute (src_vertex_ptr, dest_vertex_ptr)
| Argument | Type | Description |
|---|---|---|
src_vertex_ptr |
PrgT_Graph_Vertex * |
The source vertex in the paths. |
dest_vertex_ptr |
PrgT_Graph_Vertex * |
The destination vertex in the paths. |
Return Type
PrgT_Vector *
Vector of two routes, where each route is a vector of PrgT_Graph_Edge*. The client owns the routes and should destroy the route vector using prg_vector_destroy (routes_vptr, 1). The two routes are from the source to destination and they form the "cycle".
Header
prg_djk.h
Details
This function is similar to prg_djk_shortest_edge_disjoint_cycle_compute(), except that the paths returned may have one or more edges in common, if a completely edge-disjoint cycle cannot be found.
Note: The shortest cycle algorithms can be used only on undirected graphs (all edges are duplex).