COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
04/21/04 17:14:45 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@487
Message:

work/marci/bfs_iterator.h BfsIterator5 -> BfsIterator?, DfsIterator5 -> DfsIterator?

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/iterator_bfs_demo.cc

    r317 r360  
    104104
    105105    cout << "bfs from s ..." << endl;
    106     BfsIterator5< Graph, Graph::NodeMap<bool> > bfs(G);
     106    BfsIterator< Graph, Graph::NodeMap<bool> > bfs(G);
    107107    bfs.pushAndSetReached(s);
    108108    while (!bfs.finished()) {
     
    137137
    138138    cout << "dfs from s ..." << endl;
    139     DfsIterator5< Graph, Graph::NodeMap<bool> > dfs(G);
     139    DfsIterator< Graph, Graph::NodeMap<bool> > dfs(G);
    140140    dfs.pushAndSetReached(s);
    141141    while (!dfs.finished()) {
     
    180180
    181181    cout << "bfs from t ..." << endl;
    182     BfsIterator5< GW, GW::NodeMap<bool> > bfs(gw);
     182    BfsIterator< GW, GW::NodeMap<bool> > bfs(gw);
    183183    bfs.pushAndSetReached(t);
    184184    while (!bfs.finished()) {
     
    213213   
    214214    cout << "dfs from t ..." << endl;
    215     DfsIterator5< GW, GW::NodeMap<bool> > dfs(gw);
     215    DfsIterator< GW, GW::NodeMap<bool> > dfs(gw);
    216216    dfs.pushAndSetReached(t);
    217217    while (!dfs.finished()) {
     
    259259
    260260    cout << "bfs from t ..." << endl;
    261     BfsIterator5< GW, GW::NodeMap<bool> > bfs(gw);
     261    BfsIterator< GW, GW::NodeMap<bool> > bfs(gw);
    262262    bfs.pushAndSetReached(t);
    263263    while (!bfs.finished()) {
     
    292292   
    293293    cout << "dfs from t ..." << endl;
    294     DfsIterator5< GW, GW::NodeMap<bool> > dfs(gw);
     294    DfsIterator< GW, GW::NodeMap<bool> > dfs(gw);
    295295    dfs.pushAndSetReached(t);
    296296    while (!dfs.finished()) {
Note: See TracChangeset for help on using the changeset viewer.