prg_djk_shortest_vertex_disjoint_cycle_compute()
Note: Requires OPNET Development Kit
Abstract
Finds two paths from a source to a destination that do not have any vertices in common.
Syntax
prg_djk_shortest_vertex_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 finds two paths from the source to destination that do not have any vertices or edges in common. The goal is to find the shortest cycle such that the length of route 1 + length of route 2 is minimized subject to the disjointness constraint.
Note: The shortest cycle algorithms can be used only on undirected graphs (all edges are duplex).