Hi, does anyone have a working depth first search (recursive) code in Julia? I would rather not use the existing lightgraphs.jl or graphs.jl.
This is a somewhat confusing request. You’re interested in working code for a graph algorithm but not from one of the known, developed graph packages… What’s wrong with the implementation in LightGraphs, for example? If you don’t want dependencies, writing your own BFS is pretty straightforward.
Okay thanks, I found a good pseudocode to follow
If you wouldn’t mind sharing your reasons for not wanting to use LightGraphs, I’d be grateful.