Computes BellmanFord shortest path

Breadth-First Traversal (or Search)

Depth-First Traversal (or Search)

Computes Dijkstra's shortest path

Computes all-pairs shortest paths for a given graph using Floyd-Warshall algorithm. The ordered array of nodes and 2D Array of distances where each row and column index corresponds to a node's index in the nodes array.

Louvain method for community detection