sclass BreadthFirstPathFinder<A> implements Steppable {
  // must set
  IF1<A, Cl<A>> getChildren;
  
  // graph representation - filled during exploration
  new MultiMap<A> links;
  
  // node queue (temporary)
  new LinkedList<A> queue;
  
  *() {}
  *(IF1<A, Cl<A>> *getChildren) {}
  *(IF1<A, Cl<A>> *getChildren, A startNode) { add(startNode); }
  
  void add(A a, A prev default null) {
    if (!links.containsKey(a)) {
      links.put(a, prev);
      queue.add(a);
    }
  }
  
  public bool step() {
    ping();
    if (empty(queue)) false;
    A a = popFirst(queue);
    fOr (A b : getChildren.get(a))
      add(b, a);
    true;
  }
  
  bool nodeReached(A a) {
    ret links.containsKey(a);
  }
  
  Cl<A> getBackLinks(A a) {
    ret links.get(a);
  }
  
  L<A> examplePath(A start, A dest) {
    new L<A> path;
    A node = dest;
    path.add(node);
    do {
      if (node == null) null; // no path found
      node = first(getBackLinks(node));
      path.add(node);
    } while (node != start);
    ret reversed(path);
  }
}