Let's Code: Graph Traversal

For this event, let's do some coding! Starting with a simple graph data structure, what different ways can you come up with to explore it?

type Graph[A] = Map[A, Set[A]]

// Try to traverse `graph` from `start` to `end`
def search[A](graph: Graph[A], start: A, end: A): Boolean = ???

Whether imperative or functional, stack busting or tail recursive, Scala 2 or Scala 3, take a crack it and bring your approach to share.