prg_djk_predecessor_selection_proc_register()

Abstract

Registers the predecessor selection procedure for a specific graph.

Syntax

prg_djk_predecessor_selection_proc_register (graph_ptr, pred_selection_proc, client_state_ptr)
Argument Type Description
graph_ptr PrgT_Graph * The graph for which to register the predecessor selection callback.
pred_selection_proc PrgT_Djk_Predecessor_Selection_Proc The callback procedure to register.
client_state_ptr void * Client-managed data that is passed to the pred_selection_proc callback each time it is called.

Return Type

void

No return value.

prg_djk.h

Details

The predecessor selection procedure is used in the shortest path algorithm to limit the set of equal-cost shortest paths to a single shortest path. The selection procedure is passed a set of candidate predecessor edges and it returns the edge to select. This gives the client code more control than just using the PRGC_DJK_PATH_GET_OPT_FIRST_FOUND option.

Note: The PRGC_DJK_PATH_GET_OPT_FIRST_FOUND option takes precedence over the predecessor selection procedure.

The callback prototype is given in PrgT_Djk_Predecessor_Selection_Proc.

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