shortest-path

Guide: /api/algorithms/graph/shortest-path

Signature

shortestPath(graph, from, to, strategy);

Params:

Name	Type	Required	Default	Description
graph	IGraph<T>	+		Given graph
from	T	+		Start of path
to	T	+		End of path
strategy	IGraphIterationStrategy<T>	+		BFS/Dijkstra

Returns:

Array<T>

Throws:

IsNotFoundException when start vertex does not exist

IsNotFoundException when end vertex does not exist

IllegalStateException when there is no path at all between two vertices