.
3 #include <list_graph.hh>
4 #include <bfs_iterator.hh>
9 int main(int, char **) {
10 typedef ListGraph::NodeIt NodeIt;
11 typedef ListGraph::EdgeIt EdgeIt;
12 typedef ListGraph::EachNodeIt EachNodeIt;
13 typedef ListGraph::EachEdgeIt EachEdgeIt;
14 typedef ListGraph::OutEdgeIt OutEdgeIt;
15 typedef ListGraph::InEdgeIt InEdgeIt;
16 typedef ListGraph::SymEdgeIt SymEdgeIt;
19 LoadGraph(G, "demo.in");
21 std::cout << "bfs from the first node" << std::endl;
22 bfs<ListGraph> bfs_test(G, G.first<EachNodeIt>());
24 std::cout << "reached: ";
25 for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) {
26 std::cout << bfs_test.reached.get(i) << " ";
29 std::cout << "dist: ";
30 for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) {
31 std::cout << bfs_test.dist.get(i) << " ";