diff --git a/test/bfs_test.cc b/test/bfs_test.cc --- a/test/bfs_test.cc +++ b/test/bfs_test.cc @@ -54,27 +54,52 @@ { typedef concepts::Digraph Digraph; typedef Bfs BType; + typedef Digraph::Node Node; + typedef Digraph::Arc Arc; Digraph G; - Digraph::Node n; - Digraph::Arc e; + Node s, t; + Arc e; int l; bool b; BType::DistMap d(G); BType::PredMap p(G); + Path pp; - BType bfs_test(G); + { + BType bfs_test(G); - bfs_test.run(n); + bfs_test.run(s); + bfs_test.run(s,t); + bfs_test.run(); - l = bfs_test.dist(n); - e = bfs_test.predArc(n); - n = bfs_test.predNode(n); - d = bfs_test.distMap(); - p = bfs_test.predMap(); - b = bfs_test.reached(n); + l = bfs_test.dist(t); + e = bfs_test.predArc(t); + s = bfs_test.predNode(t); + b = bfs_test.reached(t); + d = bfs_test.distMap(); + p = bfs_test.predMap(); + pp = bfs_test.path(t); + } + { + BType + ::SetPredMap > + ::SetDistMap > + ::SetReachedMap > + ::SetProcessedMap > + ::SetStandardProcessedMap + ::Create bfs_test(G); - Path pp = bfs_test.path(n); + bfs_test.run(s); + bfs_test.run(s,t); + bfs_test.run(); + + l = bfs_test.dist(t); + e = bfs_test.predArc(t); + s = bfs_test.predNode(t); + b = bfs_test.reached(t); + pp = bfs_test.path(t); + } } void checkBfsFunctionCompile()