bfs_undirected

Function bfs_undirected 

Source
pub fn bfs_undirected(
    src: OsmNodeId,
    graph: &OsmGraph,
    valid_set: Option<&HashSet<OsmNodeId>>,
) -> Result<HashSet<OsmNodeId>, OsmError>
Expand description

finds the set of indices that are part of the same geometry cluster using a breadth-first search over an undirected graph of geometry intersection relations.

§Arguments

  • src - origin of tree
  • graph - graph to search
  • valid_set - set of valid nodes to visit, or None if all are acceptable.

§Returns

The set of node ids connected by the minimum spanning tree within the valid_set.