prg_djk_number_of_paths_get()

Abstract

Returns the number of paths to a destination that share a given edge (interface)

Syntax

prg_djk_number_of_paths_get (src_vertex_ptr, dest_vertex_ptr, edge_ptr)
Argument Type Description
src_vertex_ptr PrgT_Graph_Vertex * The vertex where the path starts.
dest_vertex_ptr PrgT_Graph_Vertex * The destination vertex for the shortest path.
edge_ptr PrgT_Graph_Edge * The edge (interface) that has paths sharing it.

Return Type

int

The number of paths to a destination that go over the edge in question

prg_djk.h

Details

Given a vertex (src_vertex_ptr) and a destination vertex (dest_vertex_ptr) as well as an edge (interface) on the src_vertex_ptr, this function returns the number of shortest paths from the src_vertex_ptr to dest_vertex_ptr that have edge_ptr as a starting edge in the path.

This function can only be called after prg_djk_single_source_compute() was run on src_vertex_ptr.

本站文档由 北京智网畅联科技有限公司 整理、翻译并提供 · 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