BFS question for directed graph

[kenahoo]

Is there a way to run a BFS search on a directed graph, but traversing edges in either direction (essentially treating it as an undirected graph)? My use case is that the directions on edges are more like edge orientations than traversal limitations - they indicate the meaning of positive or negative flow on that edge, but are otherwise unimportant to adjacency.

Also, would it be possible to add an example or two of doing a BFS (and/or DFS) traversal on a graph? I'm not quite seeing how to use the bfs_parents and bfs_tree methods in practice.

Thanks.

[simsurace]

The dev version of the docs contains a section on iterators you may find useful. For your case, you could use

for v in BFSIterator(g, source; neighbors_type=neighbors)
    # do stuff
end

No need to mess with trees.

[kenahoo]

Awesome, thanks, I'll take a look at that.

[kenahoo]

That should be neighbors_type=all_neighbors, right, since neighbors is a synonym for outneighbors in a directed graph? That's tripped me up quite a few times.

[simsurace]

Oh yes, that's right!