COIN-OR::LEMON - Graph Library

source: lemon-1.2/test/dfs_test.cc @ 459:ed54c0d13df0

Last change on this file since 459:ed54c0d13df0 was 440:88ed40ad0d4f, checked in by Alpar Juttner <alpar@…>, 11 years ago

Happy New Year again

  • update the copyright headers + run the source unifier
File size: 4.3 KB
RevLine 
[209]1/* -*- mode: C++; indent-tabs-mode: nil; -*-
[100]2 *
[209]3 * This file is a part of LEMON, a generic C++ optimization library.
[100]4 *
[440]5 * Copyright (C) 2003-2009
[100]6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8 *
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
12 *
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
15 * purpose.
16 *
17 */
18
[171]19#include <lemon/concepts/digraph.h>
20#include <lemon/smart_graph.h>
[100]21#include <lemon/list_graph.h>
[228]22#include <lemon/lgf_reader.h>
[100]23#include <lemon/dfs.h>
24#include <lemon/path.h>
[171]25
26#include "graph_test.h"
27#include "test_tools.h"
[100]28
29using namespace lemon;
30
[228]31char test_lgf[] =
32  "@nodes\n"
33  "label\n"
34  "0\n"
35  "1\n"
36  "2\n"
37  "3\n"
38  "4\n"
39  "5\n"
40  "6\n"
41  "@arcs\n"
42  "     label\n"
43  "0 1  0\n"
44  "1 2  1\n"
45  "2 3  2\n"
46  "1 4  3\n"
47  "4 2  4\n"
48  "4 5  5\n"
49  "5 0  6\n"
50  "6 3  7\n"
51  "@attributes\n"
52  "source 0\n"
53  "target 5\n";
54
[209]55void checkDfsCompile()
[100]56{
57  typedef concepts::Digraph Digraph;
58  typedef Dfs<Digraph> DType;
[286]59  typedef Digraph::Node Node;
60  typedef Digraph::Arc Arc;
[209]61
[100]62  Digraph G;
[286]63  Node s, t;
64  Arc e;
[100]65  int l;
66  bool b;
67  DType::DistMap d(G);
68  DType::PredMap p(G);
[286]69  Path<Digraph> pp;
[209]70
[286]71  {
72    DType dfs_test(G);
[209]73
[286]74    dfs_test.run(s);
75    dfs_test.run(s,t);
76    dfs_test.run();
[209]77
[286]78    l  = dfs_test.dist(t);
79    e  = dfs_test.predArc(t);
80    s  = dfs_test.predNode(t);
81    b  = dfs_test.reached(t);
82    d  = dfs_test.distMap();
83    p  = dfs_test.predMap();
84    pp = dfs_test.path(t);
85  }
86  {
87    DType
88      ::SetPredMap<concepts::ReadWriteMap<Node,Arc> >
89      ::SetDistMap<concepts::ReadWriteMap<Node,int> >
90      ::SetReachedMap<concepts::ReadWriteMap<Node,bool> >
91      ::SetProcessedMap<concepts::WriteMap<Node,bool> >
92      ::SetStandardProcessedMap
93      ::Create dfs_test(G);
[100]94
[286]95    dfs_test.run(s);
96    dfs_test.run(s,t);
97    dfs_test.run();
98
99    l  = dfs_test.dist(t);
100    e  = dfs_test.predArc(t);
101    s  = dfs_test.predNode(t);
102    b  = dfs_test.reached(t);
103    pp = dfs_test.path(t);
104  }
[100]105}
106
[209]107void checkDfsFunctionCompile()
[100]108{
109  typedef int VType;
110  typedef concepts::Digraph Digraph;
111  typedef Digraph::Arc Arc;
112  typedef Digraph::Node Node;
[209]113
[100]114  Digraph g;
[278]115  bool b;
116  dfs(g).run(Node());
117  b=dfs(g).run(Node(),Node());
118  dfs(g).run();
[100]119  dfs(g)
[278]120    .predMap(concepts::ReadWriteMap<Node,Arc>())
121    .distMap(concepts::ReadWriteMap<Node,VType>())
[100]122    .reachedMap(concepts::ReadWriteMap<Node,bool>())
123    .processedMap(concepts::WriteMap<Node,bool>())
[209]124    .run(Node());
[278]125  b=dfs(g)
126    .predMap(concepts::ReadWriteMap<Node,Arc>())
127    .distMap(concepts::ReadWriteMap<Node,VType>())
128    .reachedMap(concepts::ReadWriteMap<Node,bool>())
129    .processedMap(concepts::WriteMap<Node,bool>())
130    .path(concepts::Path<Digraph>())
131    .dist(VType())
132    .run(Node(),Node());
133  dfs(g)
134    .predMap(concepts::ReadWriteMap<Node,Arc>())
135    .distMap(concepts::ReadWriteMap<Node,VType>())
136    .reachedMap(concepts::ReadWriteMap<Node,bool>())
137    .processedMap(concepts::WriteMap<Node,bool>())
138    .run();
[100]139}
140
[171]141template <class Digraph>
142void checkDfs() {
143  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
[100]144
145  Digraph G;
146  Node s, t;
[209]147
[228]148  std::istringstream input(test_lgf);
[293]149  digraphReader(G, input).
[228]150    node("source", s).
151    node("target", t).
152    run();
[209]153
[100]154  Dfs<Digraph> dfs_test(G);
[209]155  dfs_test.run(s);
156
[100]157  Path<Digraph> p = dfs_test.path(t);
[171]158  check(p.length() == dfs_test.dist(t),"path() found a wrong path.");
[100]159  check(checkPath(G, p),"path() found a wrong path.");
160  check(pathSource(G, p) == s,"path() found a wrong path.");
161  check(pathTarget(G, p) == t,"path() found a wrong path.");
[209]162
[100]163  for(NodeIt v(G); v!=INVALID; ++v) {
[228]164    if (dfs_test.reached(v)) {
165      check(v==s || dfs_test.predArc(v)!=INVALID, "Wrong tree.");
166      if (dfs_test.predArc(v)!=INVALID ) {
167        Arc e=dfs_test.predArc(v);
168        Node u=G.source(e);
169        check(u==dfs_test.predNode(v),"Wrong tree.");
170        check(dfs_test.dist(v) - dfs_test.dist(u) == 1,
171              "Wrong distance. (" << dfs_test.dist(u) << "->"
[278]172              << dfs_test.dist(v) << ")");
[228]173      }
[100]174    }
175  }
[278]176
177  {
178    NullMap<Node,Arc> myPredMap;
179    dfs(G).predMap(myPredMap).run(s);
180  }
[100]181}
182
[171]183int main()
184{
185  checkDfs<ListDigraph>();
186  checkDfs<SmartDigraph>();
187  return 0;
188}
Note: See TracBrowser for help on using the repository browser.