BitGraph.Dfs (bitgraph v0.1.12)
Depth-first search. Implementation roughly follows https://cp-algorithms.com/graph/depth-first-search.html
Summary
Functions
Options:
vertices
- list of vertex indices (not vertex ids!) or :all (default)state
- initial statedirection
- direction of edges connected to current vertex- :forward - out-edges
- :reverse - in-edges
- :both - all edges
process_vertex_fun
callback for processing verticesprocess_edge_fun
- callback for processing edgesedge_process_order
- whether the (dfs tree) edge processing will be made- before (:preorder, default) - after (:postorder) - before and after (:both)