r950:2d583da4ba40
Thu, 04 Aug 2011 21:47:29
[Not Reviewed]
0 comments (0 inline)
0
4
1
169
17
6
| 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
|
| 2 |
* |
|
| 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
|
| 4 |
* |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 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 |
|
|
| 19 |
#include <lemon/list_graph.h> |
|
| 20 |
#include <lemon/lgf_reader.h> |
|
| 21 |
#include "test_tools.h" |
|
| 22 |
|
|
| 23 |
using namespace lemon; |
|
| 24 |
|
|
| 25 |
char test_lgf[] = |
|
| 26 |
"@nodes\n" |
|
| 27 |
"label\n" |
|
| 28 |
"0\n" |
|
| 29 |
"1\n" |
|
| 30 |
"@arcs\n" |
|
| 31 |
" label\n" |
|
| 32 |
"0 1 0\n" |
|
| 33 |
"1 0 1\n" |
|
| 34 |
"@attributes\n" |
|
| 35 |
"source 0\n" |
|
| 36 |
"target 1\n"; |
|
| 37 |
|
|
| 38 |
char test_lgf_nomap[] = |
|
| 39 |
"@nodes\n" |
|
| 40 |
"label\n" |
|
| 41 |
"0\n" |
|
| 42 |
"1\n" |
|
| 43 |
"@arcs\n" |
|
| 44 |
" -\n" |
|
| 45 |
"0 1\n"; |
|
| 46 |
|
|
| 47 |
char test_lgf_bad1[] = |
|
| 48 |
"@nodes\n" |
|
| 49 |
"label\n" |
|
| 50 |
"0\n" |
|
| 51 |
"1\n" |
|
| 52 |
"@arcs\n" |
|
| 53 |
" - another\n" |
|
| 54 |
"0 1\n"; |
|
| 55 |
|
|
| 56 |
char test_lgf_bad2[] = |
|
| 57 |
"@nodes\n" |
|
| 58 |
"label\n" |
|
| 59 |
"0\n" |
|
| 60 |
"1\n" |
|
| 61 |
"@arcs\n" |
|
| 62 |
" label -\n" |
|
| 63 |
"0 1\n"; |
|
| 64 |
|
|
| 65 |
|
|
| 66 |
int main() |
|
| 67 |
{
|
|
| 68 |
{
|
|
| 69 |
ListDigraph d; |
|
| 70 |
ListDigraph::Node s,t; |
|
| 71 |
ListDigraph::ArcMap<int> label(d); |
|
| 72 |
std::istringstream input(test_lgf); |
|
| 73 |
digraphReader(d, input). |
|
| 74 |
node("source", s).
|
|
| 75 |
node("target", t).
|
|
| 76 |
arcMap("label", label).
|
|
| 77 |
run(); |
|
| 78 |
check(countNodes(d) == 2,"There should be 2 nodes"); |
|
| 79 |
check(countArcs(d) == 2,"There should be 2 arcs"); |
|
| 80 |
} |
|
| 81 |
{
|
|
| 82 |
ListGraph g; |
|
| 83 |
ListGraph::Node s,t; |
|
| 84 |
ListGraph::EdgeMap<int> label(g); |
|
| 85 |
std::istringstream input(test_lgf); |
|
| 86 |
graphReader(g, input). |
|
| 87 |
node("source", s).
|
|
| 88 |
node("target", t).
|
|
| 89 |
edgeMap("label", label).
|
|
| 90 |
run(); |
|
| 91 |
check(countNodes(g) == 2,"There should be 2 nodes"); |
|
| 92 |
check(countEdges(g) == 2,"There should be 2 arcs"); |
|
| 93 |
} |
|
| 94 |
|
|
| 95 |
{
|
|
| 96 |
ListDigraph d; |
|
| 97 |
std::istringstream input(test_lgf_nomap); |
|
| 98 |
digraphReader(d, input). |
|
| 99 |
run(); |
|
| 100 |
check(countNodes(d) == 2,"There should be 2 nodes"); |
|
| 101 |
check(countArcs(d) == 1,"There should be 1 arc"); |
|
| 102 |
} |
|
| 103 |
{
|
|
| 104 |
ListGraph g; |
|
| 105 |
std::istringstream input(test_lgf_nomap); |
|
| 106 |
graphReader(g, input). |
|
| 107 |
run(); |
|
| 108 |
check(countNodes(g) == 2,"There should be 2 nodes"); |
|
| 109 |
check(countEdges(g) == 1,"There should be 1 edge"); |
|
| 110 |
} |
|
| 111 |
|
|
| 112 |
{
|
|
| 113 |
ListDigraph d; |
|
| 114 |
std::istringstream input(test_lgf_bad1); |
|
| 115 |
bool ok=false; |
|
| 116 |
try {
|
|
| 117 |
digraphReader(d, input). |
|
| 118 |
run(); |
|
| 119 |
} |
|
| 120 |
catch (FormatError& error) |
|
| 121 |
{
|
|
| 122 |
ok = true; |
|
| 123 |
} |
|
| 124 |
check(ok,"FormatError exception should have occured"); |
|
| 125 |
} |
|
| 126 |
{
|
|
| 127 |
ListGraph g; |
|
| 128 |
std::istringstream input(test_lgf_bad1); |
|
| 129 |
bool ok=false; |
|
| 130 |
try {
|
|
| 131 |
graphReader(g, input). |
|
| 132 |
run(); |
|
| 133 |
} |
|
| 134 |
catch (FormatError& error) |
|
| 135 |
{
|
|
| 136 |
ok = true; |
|
| 137 |
} |
|
| 138 |
check(ok,"FormatError exception should have occured"); |
|
| 139 |
} |
|
| 140 |
|
|
| 141 |
{
|
|
| 142 |
ListDigraph d; |
|
| 143 |
std::istringstream input(test_lgf_bad2); |
|
| 144 |
bool ok=false; |
|
| 145 |
try {
|
|
| 146 |
digraphReader(d, input). |
|
| 147 |
run(); |
|
| 148 |
} |
|
| 149 |
catch (FormatError& error) |
|
| 150 |
{
|
|
| 151 |
ok = true; |
|
| 152 |
} |
|
| 153 |
check(ok,"FormatError exception should have occured"); |
|
| 154 |
} |
|
| 155 |
{
|
|
| 156 |
ListGraph g; |
|
| 157 |
std::istringstream input(test_lgf_bad2); |
|
| 158 |
bool ok=false; |
|
| 159 |
try {
|
|
| 160 |
graphReader(g, input). |
|
| 161 |
run(); |
|
| 162 |
} |
|
| 163 |
catch (FormatError& error) |
|
| 164 |
{
|
|
| 165 |
ok = true; |
|
| 166 |
} |
|
| 167 |
check(ok,"FormatError exception should have occured"); |
|
| 168 |
} |
|
| 169 |
} |
| ... | ... |
@@ -58,35 +58,46 @@ |
| 58 | 58 |
\code |
| 59 | 59 |
@nodes |
| 60 | 60 |
label coordinates size title |
| 61 | 61 |
1 (10,20) 10 "First node" |
| 62 | 62 |
2 (80,80) 8 "Second node" |
| 63 | 63 |
3 (40,10) 10 "Third node" |
| 64 | 64 |
\endcode |
| 65 | 65 |
|
| 66 |
The \c \@arcs section is very similar to the \c \@nodes section, |
|
| 67 |
it again starts with a header line describing the names of the maps, |
|
| 68 |
but the \c "label" map is not obligatory here. The following lines |
|
| 69 |
describe the arcs. The first two tokens of each line are |
|
| 70 |
|
|
| 66 |
The \c \@arcs section is very similar to the \c \@nodes section, it |
|
| 67 |
again starts with a header line describing the names of the maps, but |
|
| 68 |
the \c "label" map is not obligatory here. The following lines |
|
| 69 |
describe the arcs. The first two tokens of each line are the source |
|
| 70 |
and the target node of the arc, respectively, then come the map |
|
| 71 | 71 |
values. The source and target tokens must be node labels. |
| 72 | 72 |
|
| 73 | 73 |
\code |
| 74 | 74 |
@arcs |
| 75 | 75 |
capacity |
| 76 | 76 |
1 2 16 |
| 77 | 77 |
1 3 12 |
| 78 | 78 |
2 3 18 |
| 79 | 79 |
\endcode |
| 80 | 80 |
|
| 81 |
If there is no map in the \c \@arcs section at all, then it must be |
|
| 82 |
indicated by a sole '-' sign in the first line. |
|
| 83 |
|
|
| 84 |
\code |
|
| 85 |
@arcs |
|
| 86 |
- |
|
| 87 |
1 2 |
|
| 88 |
1 3 |
|
| 89 |
2 3 |
|
| 90 |
\endcode |
|
| 91 |
|
|
| 81 | 92 |
The \c \@edges is just a synonym of \c \@arcs. The \@arcs section can |
| 82 | 93 |
also store the edge set of an undirected graph. In such case there is |
| 83 | 94 |
a conventional method for store arc maps in the file, if two columns |
| 84 |
|
|
| 95 |
have the same caption with \c '+' and \c '-' prefix, then these columns |
|
| 85 | 96 |
can be regarded as the values of an arc map. |
| 86 | 97 |
|
| 87 | 98 |
The \c \@attributes section contains key-value pairs, each line |
| 88 | 99 |
consists of two tokens, an attribute name, and then an attribute |
| 89 | 100 |
value. The value of the attribute could be also a label value of a |
| 90 | 101 |
node or an edge, or even an edge label prefixed with \c '+' or \c '-', |
| 91 | 102 |
which regards to the forward or backward directed arc of the |
| 92 | 103 |
corresponding edge. |
| 1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
| 2 | 2 |
* |
| 3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| 7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
| 8 | 8 |
* |
| 9 | 9 |
* Permission to use, modify and distribute this software is granted |
| 10 | 10 |
* provided that this copyright notice appears in all copies. For |
| 11 | 11 |
* precise terms see the accompanying LICENSE file. |
| 12 | 12 |
* |
| 13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
| ... | ... |
@@ -959,16 +959,23 @@ |
| 959 | 959 |
line.putback(c); |
| 960 | 960 |
|
| 961 | 961 |
{
|
| 962 | 962 |
std::map<std::string, int> maps; |
| 963 | 963 |
|
| 964 | 964 |
std::string map; |
| 965 | 965 |
int index = 0; |
| 966 | 966 |
while (_reader_bits::readToken(line, map)) {
|
| 967 |
if(map == "-") {
|
|
| 968 |
if(index!=0) |
|
| 969 |
throw FormatError("'-' is not allowed as a map name");
|
|
| 970 |
else if (line >> std::ws >> c) |
|
| 971 |
throw FormatError("Extra character at the end of line");
|
|
| 972 |
else break; |
|
| 973 |
} |
|
| 967 | 974 |
if (maps.find(map) != maps.end()) {
|
| 968 | 975 |
std::ostringstream msg; |
| 969 | 976 |
msg << "Multiple occurence of arc map: " << map; |
| 970 | 977 |
throw FormatError(msg.str()); |
| 971 | 978 |
} |
| 972 | 979 |
maps.insert(std::make_pair(map, index)); |
| 973 | 980 |
++index; |
| 974 | 981 |
} |
| ... | ... |
@@ -1829,16 +1836,23 @@ |
| 1829 | 1836 |
line.putback(c); |
| 1830 | 1837 |
|
| 1831 | 1838 |
{
|
| 1832 | 1839 |
std::map<std::string, int> maps; |
| 1833 | 1840 |
|
| 1834 | 1841 |
std::string map; |
| 1835 | 1842 |
int index = 0; |
| 1836 | 1843 |
while (_reader_bits::readToken(line, map)) {
|
| 1844 |
if(map == "-") {
|
|
| 1845 |
if(index!=0) |
|
| 1846 |
throw FormatError("'-' is not allowed as a map name");
|
|
| 1847 |
else if (line >> std::ws >> c) |
|
| 1848 |
throw FormatError("Extra character at the end of line");
|
|
| 1849 |
else break; |
|
| 1850 |
} |
|
| 1837 | 1851 |
if (maps.find(map) != maps.end()) {
|
| 1838 | 1852 |
std::ostringstream msg; |
| 1839 | 1853 |
msg << "Multiple occurence of edge map: " << map; |
| 1840 | 1854 |
throw FormatError(msg.str()); |
| 1841 | 1855 |
} |
| 1842 | 1856 |
maps.insert(std::make_pair(map, index)); |
| 1843 | 1857 |
++index; |
| 1844 | 1858 |
} |
| ... | ... |
@@ -28,16 +28,17 @@ |
| 28 | 28 |
fractional_matching_test |
| 29 | 29 |
gomory_hu_test |
| 30 | 30 |
graph_copy_test |
| 31 | 31 |
graph_test |
| 32 | 32 |
graph_utils_test |
| 33 | 33 |
hao_orlin_test |
| 34 | 34 |
heap_test |
| 35 | 35 |
kruskal_test |
| 36 |
lgf_test |
|
| 36 | 37 |
maps_test |
| 37 | 38 |
matching_test |
| 38 | 39 |
max_cardinality_search_test |
| 39 | 40 |
max_clique_test |
| 40 | 41 |
min_cost_arborescence_test |
| 41 | 42 |
min_cost_flow_test |
| 42 | 43 |
min_mean_cycle_test |
| 43 | 44 |
nagamochi_ibaraki_test |
| ... | ... |
@@ -26,16 +26,17 @@ |
| 26 | 26 |
test/fractional_matching_test \ |
| 27 | 27 |
test/gomory_hu_test \ |
| 28 | 28 |
test/graph_copy_test \ |
| 29 | 29 |
test/graph_test \ |
| 30 | 30 |
test/graph_utils_test \ |
| 31 | 31 |
test/hao_orlin_test \ |
| 32 | 32 |
test/heap_test \ |
| 33 | 33 |
test/kruskal_test \ |
| 34 |
test/lgf_test \ |
|
| 34 | 35 |
test/maps_test \ |
| 35 | 36 |
test/matching_test \ |
| 36 | 37 |
test/max_cardinality_search_test \ |
| 37 | 38 |
test/max_clique_test \ |
| 38 | 39 |
test/min_cost_arborescence_test \ |
| 39 | 40 |
test/min_cost_flow_test \ |
| 40 | 41 |
test/min_mean_cycle_test \ |
| 41 | 42 |
test/nagamochi_ibaraki_test \ |
| ... | ... |
@@ -75,19 +76,20 @@ |
| 75 | 76 |
test_edge_set_test_SOURCES = test/edge_set_test.cc |
| 76 | 77 |
test_error_test_SOURCES = test/error_test.cc |
| 77 | 78 |
test_euler_test_SOURCES = test/euler_test.cc |
| 78 | 79 |
test_fractional_matching_test_SOURCES = test/fractional_matching_test.cc |
| 79 | 80 |
test_gomory_hu_test_SOURCES = test/gomory_hu_test.cc |
| 80 | 81 |
test_graph_copy_test_SOURCES = test/graph_copy_test.cc |
| 81 | 82 |
test_graph_test_SOURCES = test/graph_test.cc |
| 82 | 83 |
test_graph_utils_test_SOURCES = test/graph_utils_test.cc |
| 84 |
test_hao_orlin_test_SOURCES = test/hao_orlin_test.cc |
|
| 83 | 85 |
test_heap_test_SOURCES = test/heap_test.cc |
| 84 | 86 |
test_kruskal_test_SOURCES = test/kruskal_test.cc |
| 85 |
|
|
| 87 |
test_lgf_test_SOURCES = test/lgf_test.cc |
|
| 86 | 88 |
test_lp_test_SOURCES = test/lp_test.cc |
| 87 | 89 |
test_maps_test_SOURCES = test/maps_test.cc |
| 88 | 90 |
test_mip_test_SOURCES = test/mip_test.cc |
| 89 | 91 |
test_matching_test_SOURCES = test/matching_test.cc |
| 90 | 92 |
test_max_cardinality_search_test_SOURCES = test/max_cardinality_search_test.cc |
| 91 | 93 |
test_max_clique_test_SOURCES = test/max_clique_test.cc |
| 92 | 94 |
test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc |
| 93 | 95 |
test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc |
0 comments (0 inline)