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.
Header
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().