Traversal#

Breadth-first-search#

`cugraph.bfs`(G[, start, depth_limit, ...])	Find the distances and predecessors for a breadth first traversal of a graph.
`cugraph.bfs_edges`(G, source[, reverse, ...])	Find the distances and predecessors for a breadth first traversal of a graph.

Breadth-first-search (MG)#

cugraph.dask.traversal.bfs.bfs(input_graph, ...)

Find the distances and predecessors for a breadth-first traversal of a graph.

Single-source-shortest-path#

`cugraph.filter_unreachable`(df)	Remove unreachable vertices from the result of SSSP or BFS
`cugraph.shortest_path`(G[, source, method, ...])	Alias for sssp(), provided for API compatibility with NetworkX.
`cugraph.shortest_path_length`(G, source[, target])	Compute the distance from a source vertex to one or all vertexes in graph.
`cugraph.sssp`(G[, source, method, directed, ...])	Compute the distance and predecessors for shortest paths from the specified source to all the vertices in the graph.

Single-source-shortest-path (MG)#

cugraph.dask.traversal.sssp.sssp(...[, ...])

Compute the distance and predecessors for shortest paths from the specified source to all the vertices in the input_graph.