COIN-OR::LEMON - Graph Library

Changeset 1283:fc20371677b9 in lemon-0.x for src/test


Ignore:
Timestamp:
03/31/05 15:31:39 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1715
Message:

getPath() added to Bfs/Dfs/Dijkstra?.

Location:
src/test
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • src/test/bfs_test.cc

    r1220 r1283  
    1818#include <lemon/smart_graph.h>
    1919#include <lemon/bfs.h>
     20#include <lemon/path.h>
    2021#include<lemon/concept/graph.h>
    2122
     
    5758  b  = bfs_test.reached(n);
    5859
     60  DirPath<Graph> pp(G);
     61  bfs_test.getPath(pp,n);
    5962}
    6063
     
    104107  check(bfs_test.dist(t)==3,"Bfs found a wrong path. " << bfs_test.dist(t));
    105108
     109  DirPath<Graph> p(G);
     110  check(bfs_test.getPath(p,t),"getPath() failed to set the path.");
     111  check(p.length()==3,"getPath() found a wrong path.");
     112 
    106113
    107114  for(EdgeIt e(G); e==INVALID; ++e) {
  • src/test/dfs_test.cc

    r1233 r1283  
    1818#include <lemon/smart_graph.h>
    1919#include <lemon/dfs.h>
     20#include <lemon/path.h>
    2021#include <lemon/concept/graph.h>
    2122
     
    5758  b  = dfs_test.reached(n);
    5859
     60  DirPath<Graph> pp(G);
     61  dfs_test.getPath(pp,n);
    5962}
    6063
     
    103106  dfs_test.run(s); 
    104107 
     108  DirPath<Graph> p(G);
     109  check(dfs_test.getPath(p,t),"getPath() failed to set the path.");
     110  check(p.length()==dfs_test.dist(t),"getPath() found a wrong path.");
     111 
    105112  for(NodeIt v(G); v!=INVALID; ++v) {
    106113    check(dfs_test.reached(v),"Each node should be reached.");
  • src/test/dijkstra_test.cc

    r1220 r1283  
    1818#include <lemon/smart_graph.h>
    1919#include <lemon/dijkstra.h>
     20#include <lemon/path.h>
    2021#include <lemon/maps.h>
    2122#include <lemon/concept/graph.h>
     
    6061  //  pn = dijkstra_test.predNodeMap();
    6162  b  = dijkstra_test.reached(n);
    62  
     63
     64  DirPath<Graph> pp(G);
     65  dijkstra_test.getPath(pp,n);
    6366}
    6467
     
    115118
    116119
     120  DirPath<Graph> p(G);
     121  check(dijkstra_test.getPath(p,t),"getPath() failed to set the path.");
     122  check(p.length()==4,"getPath() found a wrong path.");
     123 
     124
    117125  for(EdgeIt e(G); e!=INVALID; ++e) {
    118126    Node u=G.source(e);
Note: See TracChangeset for help on using the changeset viewer.