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".

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).

本站文档由 北京智网畅联科技有限公司 整理、翻译并提供 · Documentation compiled and provided by Beijing ZNetLink Technology Co., Ltd.

交流群 · QQ Group:OPNET/智网妙算网络仿真交流群(群号 486383494)

原文档 © 2017 Riverbed Technology · 本站为公益翻译,由 AI 辅助完成,请仔细甄别

Original documentation © 2017 Riverbed Technology. Community translation, AI-assisted. Contact: jiazequn@znetlink.com