RhodeCode

  p  = bfs_test.predMap();

  //  pn = bfs_test.predNodeMap();

  b  = bfs_test.reached(n);

  Path<Digraph> pp = bfs_test.path(n);

}

void checkBfsFunctionCompile()

{

  typedef int VType;

  typedef concepts::Digraph Digraph;

  typedef Digraph::Arc Arc;

  typedef Digraph::Node Node;

  Digraph g;

  bfs(g,Node()).run();

  bfs(g).source(Node()).run();

  bfs(g)

    .predMap(concepts::WriteMap<Node,Arc>())

    .distMap(concepts::WriteMap<Node,VType>())

    .reachedMap(concepts::ReadWriteMap<Node,bool>())

    .processedMap(concepts::WriteMap<Node,bool>())

    .run(Node());

}

template <class Digraph>

void checkBfs() {

  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

  Digraph G;

  Node s, t;

  PetStruct<Digraph> ps = addPetersen(G, 5);

  s=ps.outer[2];

  t=ps.inner[0];

  Bfs<Digraph> bfs_test(G);

  bfs_test.run(s);

  check(bfs_test.dist(t)==3,"Bfs found a wrong path." << bfs_test.dist(t));

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

  check(p.length()==3,"path() found a wrong path.");

  check(checkPath(G, p),"path() found a wrong path.");

  check(pathSource(G, p) == s,"path() found a wrong path.");

  check(pathTarget(G, p) == t,"path() found a wrong path.");

    Node u=G.source(e);

    Node v=G.target(e);

    check( !bfs_test.reached(u) ||

           "Wrong output.");

  }

    check(bfs_test.reached(v),"Each node should be reached.");

    if ( bfs_test.predArc(v)!=INVALID ) {

      Arc e=bfs_test.predArc(v);

      Node u=G.source(e);

      check(u==bfs_test.predNode(v),"Wrong tree.");

      check(bfs_test.dist(v) - bfs_test.dist(u) == 1,

            "Wrong distance. Difference: "

            << std::abs(bfs_test.dist(v) - bfs_test.dist(u)

                        - 1));

    }

  }

}

int main()

{

  checkBfs<ListDigraph>();

  checkBfs<SmartDigraph>();

  return 0;

}