prg_djk_graph_init()

Abstract

Attaches the DJK state to the graph and allows the shortest path computations to be performed.

Syntax

prg_djk_graph_init (graph_ptr)
Argument Type Description
graph_ptr PrgT_Graph * The graph that will be initialized with the DJK state.

Return Type

PrgT_Compcode

PrgC_Compcode_Success if initialization succeeds; PrgC_Compcode_Failure otherwise.

prg_djk.h

Details

Initializes and attaches the DJK state (required state to run the shortest path algorithms) to the graph. This includes the graph itself as well as the vertices and edges.

To use the DJK package functions on the graph, prg_djk_graph_init() must be called first. In addition, if you add edges or vertices to the graph after the initial call to init, you must call it again to make sure that all the necessary states are initialized. This will add the DJK state to all the newly added elements of the graph.

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