PrgT_Djk_Predecessor_Selection_Proc

Abstract

Callback: Used to limit the set of equal-cost shortest paths to a single shortest path.

Syntax

PrgT_Djk_Predecessor_Selection_Proc (edge_lptr, client_state_ptr)
Argument Type Description
edge_lptr PrgT_List * List of candidate edges to evaluate and select from. The list is owned by the DJK algorithm.
client_state_ptr void * The client state information registered by the client.

Return Type

PrgT_Graph_Edge *

The predecessor edge that has been selected.

prg_djk.h

Details

This callback 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 function is registered by prg_djk_predecessor_selection_proc_register().

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