Fast graph algorithms based on sparse matrix representations.
|connected_components(csgraph[, directed, ...])||Analyze the
connected components of a sparse graph ..| |laplacian(csgraph[,
normed, return_diag])||Return the Laplacian matrix of a directed
graph.| |shortest_path(csgraph[, method, directed,
...])||Perform a shortest-path graph search on a positive
directed or undirected graph.| |dijkstra(csgraph[, directed,
indices, ...])||Dijkstra algorithm using Fibonacci Heaps|
|floyd_warshall(csgraph[, directed, ...])||Compute the shortest
path lengths using the Floyd-Warshall algorithm|
|bellman_ford(csgraph[, directed, indices, ...])||Compute the
shortest path lengths using the Bellman-Ford algorithm.|
|johnson(csgraph[, directed, indices, ...])||Compute the
shortest path lengths using Johnson’s algorithm.|
|breadth_first_order(csgraph, i_start[, ...])||Return a breadth-
first ordering starting with specified node.|
|depth_first_order(csgraph, i_start[, ...])||Return a depth-
first ordering starting with specif