411 REFERENCE · Wikibooks
99 Elm Problems/Problem 87
Reference material by Wikibooks contributors. This retains its source identity and is not 411 news reporting.
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:
import Html exposing (text)
import List
f : Int -> Int
-- your implementation goes here
main = text (toString (f 0))
Result:
4
Solutions