[<< wikibooks] 99 Elm Problems/Problem 88
Output a depth-first order graph traversal of a graph given the starting node. The output should be a list of nodes that are reachable from the starting point and sorted in depth-first order.
# # # THIS IS A STUB # # #

Example in Elm:

Result:

Solutions