prg_djk_path_cost_get

Abstract

Finds the cost of the shortest path between a source and a destination vertex

Syntax

prg_djk_path_cost_get (src_vertex_ptr, dest_vertex_ptr)
Argument Type Description
src_vertex_ptr PrgT_Graph_Vertex * The starting point vertex in the shortest path.
dest_vertex_ptr PrgT_Graph_Vertex * The end (destination) vertex in the shortest path.

Return Type

double

Cost of the shortest path

prg_djk.h

Details

Given a source and a destination vertex, the function returns the cost of the shortest path between the two vertices.

This function can only be called after prg_djk_single_source_compute() has been called.

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