Path Selection (Predecessor Selection)

The shortest path calculation generates a predecessor list for each vertex. If this list defines more than one path, generating the entire list of shortest paths requires more (possibly exponential) time and memory. There are two ways to increase efficiency.

  • To select an arbitrary single shortest-path, use the following call instead of prg_djk_path_get():
	prg_djk_ path_get_options (..., ..., PRGC_DJK_PATH_GET_OPT_FIRST_FOUND)