1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/* -*- mode: C++; indent-tabs-mode: nil; -*-
*
* This file is a part of LEMON, a generic C++ optimization library.
*
* Copyright (C) 2003-2011
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
* Permission to use, modify and distribute this software is granted
* provided that this copyright notice appears in all copies. For
* precise terms see the accompanying LICENSE file.
*
* This software is provided "AS IS" with no warranty of any kind,
* express or implied, and with no claim as to its suitability for any
* purpose.
*
*/
#include <lemon/list_graph.h>
#include <lemon/lgf_reader.h>
#include "test_tools.h"
using namespace lemon;
char test_lgf[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" label\n"
"0 1 0\n"
"1 0 1\n"
"@attributes\n"
"source 0\n"
"target 1\n";
char test_lgf_nomap[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" -\n"
"0 1\n";
char test_lgf_bad1[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" - another\n"
"0 1\n";
char test_lgf_bad2[] =
"@nodes\n"
"label\n"
"0\n"
"1\n"
"@arcs\n"
" label -\n"
"0 1\n";
int main()
{
{
ListDigraph d;
ListDigraph::Node s,t;
ListDigraph::ArcMap<int> label(d);
std::istringstream input(test_lgf);
digraphReader(d, input).
node("source", s).
node("target", t).
arcMap("label", label).
run();
check(countNodes(d) == 2,"There should be 2 nodes");
check(countArcs(d) == 2,"There should be 2 arcs");
}
{
ListGraph g;
ListGraph::Node s,t;
ListGraph::EdgeMap<int> label(g);
std::istringstream input(test_lgf);
graphReader(g, input).
node("source", s).
node("target", t).
edgeMap("label", label).
run();
check(countNodes(g) == 2,"There should be 2 nodes");
check(countEdges(g) == 2,"There should be 2 arcs");
}
{
ListDigraph d;
std::istringstream input(test_lgf_nomap);
digraphReader(d, input).
run();
check(countNodes(d) == 2,"There should be 2 nodes");
check(countArcs(d) == 1,"There should be 1 arc");
}
{
ListGraph g;
std::istringstream input(test_lgf_nomap);
graphReader(g, input).
run();
check(countNodes(g) == 2,"There should be 2 nodes");
check(countEdges(g) == 1,"There should be 1 edge");
}
{
ListDigraph d;
std::istringstream input(test_lgf_bad1);
bool ok=false;
try {
digraphReader(d, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
{
ListGraph g;
std::istringstream input(test_lgf_bad1);
bool ok=false;
try {
graphReader(g, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
{
ListDigraph d;
std::istringstream input(test_lgf_bad2);
bool ok=false;
try {
digraphReader(d, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
{
ListGraph g;
std::istringstream input(test_lgf_bad2);
bool ok=false;
try {
graphReader(g, input).
run();
}
catch (FormatError&)
{
ok = true;
}
check(ok,"FormatError exception should have occured");
}
}
|
