Documentation
¶
Overview ¶
Package spd finds the shortest path using Bellman-Ford algorithm. It works with negative edges.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func SPBF ¶
SPBF returns false if there is a negatively-weighted cycle that is reachable from the source vertex , which means that there is no shortest path since the negatively-weighted cycle adds up the infinite negative. Otherwise it returns the shortest path in the graph that can contain negative edges.
Types ¶
This section is empty.
Source Files
Click to show internal directories.
Click to hide internal directories.