COIN-OR::LEMON - Graph Library

Changeset 793:9cd0aeea47b0 in lemon-0.x for src/test/dfs_test.cc


Ignore:
Timestamp:
09/03/04 11:41:50 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1087
Message:
  • BFD/DFS/Dijkstra compile test is done with skeleton::GraphSkeleton? graph and skeleton::ReadMap?.
  • 'skeleton::' is explicitely written instead of 'using namespace ...' in graph_test.cc
  • Output messages of type "makeRep(3)..." in unionfind_test.cc have been changed in order not to confuse compiler output parsers.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/dfs_test.cc

    r780 r793  
    22#include <hugo/smart_graph.h>
    33#include <hugo/dfs.h>
     4#include<hugo/skeletons/graph.h>
    45
    56using namespace hugo;
     
    1011void check_Dfs_SmartGraph_Compile()
    1112{
    12   typedef int VType;
    13   typedef SmartGraph Graph;
     13  typedef skeleton::StaticGraphSkeleton Graph;
    1414
    1515  typedef Graph::Edge Edge;
     
    1717  typedef Graph::EdgeIt EdgeIt;
    1818  typedef Graph::NodeIt NodeIt;
    19   typedef Graph::EdgeMap<VType> LengthMap;
    2019 
    21   typedef Dfs<Graph> BType;
     20  typedef Dfs<Graph> DType;
    2221 
    2322  Graph G;
    2423  Node n;
    2524  Edge e;
    26   VType l;
     25  int l;
    2726  bool b;
    28   BType::DistMap d(G);
    29   BType::PredMap p(G);
    30   BType::PredNodeMap pn(G);
    31   LengthMap cap(G);
     27  DType::DistMap d(G);
     28  DType::PredMap p(G);
     29  DType::PredNodeMap pn(G);
    3230 
    33   BType dfs_test(G);
     31  DType dfs_test(G);
    3432 
    3533  dfs_test.run(n);
Note: See TracChangeset for help on using the changeset viewer.