RhodeCode

    ///- the distance of \c t from the root in the %DFS tree.

    ///

    ///\pre init() must be called and a root node should be

    ///added with addSource() before using this function.

    void start(Node t)

    {

        processNextArc();

    }

    ///Executes the algorithm until a condition is met.

    ///Executes the algorithm until a condition is met.

    /// - the %DFS path to \c t,

    /// - the distance of \c t from the root in the %DFS tree.

    ///

    /// \pre init() must be called and a root node should be added

    /// with addSource() before using this function.

    void start(Node t) {

        processNextArc();

    }

    /// \brief Executes the algorithm until a condition is met.

    ///

    /// Executes the algorithm until a condition is met.

  "4 2  4\n"

  "4 5  5\n"

  "5 0  6\n"

  "6 3  7\n"

  "@attributes\n"

  "source 0\n"

void checkDfsCompile()

{

  typedef concepts::Digraph Digraph;

  typedef Dfs<Digraph> DType;

  typedef Digraph::Node Node;

template <class Digraph>

void checkDfs() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph G;

  Node s, t;

  std::istringstream input(test_lgf);

  digraphReader(G, input).

    node("source", s).

    node("target", t).

    run();

  Dfs<Digraph> dfs_test(G);

  dfs_test.run(s);

  Path<Digraph> p = dfs_test.path(t);

              << dfs_test.dist(v) << ")");

      }

    }

  }

  {

    NullMap<Node,Arc> myPredMap;

    dfs(G).predMap(myPredMap).run(s);

  }

}

int main()