The graph which has to be searched using the BFS algorithm
The node form which to start
Performs a dijkstra search on a graph
The graph on which to perform the Dijkstra search
The node from which to start
Finds the diameter of the graph
returns an object with a start, end - the two points of a graph and the diameter of the graph
Generated using TypeDoc
Performs a BFS search on a graph - Async because it takes a while on large graphs