COIN-OR::LEMON - Graph Library

Changeset 793:9cd0aeea47b0 in lemon-0.x for src/test/dijkstra_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/dijkstra_test.cc

    r780 r793  
    22#include <hugo/smart_graph.h>
    33#include <hugo/dijkstra.h>
    4 
     4#include<hugo/skeletons/graph.h>
     5#include<hugo/skeletons/maps.h>
    56using namespace hugo;
    67
     
    89
    910
    10 void check_Dijkstra_SmartGraph_BinHeap_Compile()
     11void check_Dijkstra_BinHeap_Compile()
    1112{
    1213  typedef int VType;
    13   typedef SmartGraph Graph;
     14  typedef skeleton::StaticGraphSkeleton Graph;
    1415
    1516  typedef Graph::Edge Edge;
     
    1718  typedef Graph::EdgeIt EdgeIt;
    1819  typedef Graph::NodeIt NodeIt;
    19   typedef Graph::EdgeMap<VType> LengthMap;
     20  typedef skeleton::ReadMap<Edge,VType> LengthMap;
    2021 
    2122  typedef Dijkstra<Graph, LengthMap> DType;
     
    2930  DType::PredMap p(G);
    3031  DType::PredNodeMap pn(G);
    31   LengthMap cap(G);
     32  LengthMap cap;
    3233
    3334  DType dijkstra_test(G,cap);
Note: See TracChangeset for help on using the changeset viewer.