... |
... |
@@ -32,15 +32,7 @@
|
32 |
32 |
namespace lemon {
|
33 |
33 |
|
34 |
|
///@defgroup dimacs_group DIMACS format
|
35 |
|
///\brief Read and write files in DIMACS format
|
36 |
|
///
|
37 |
|
///Tools to read a digraph from or write it to a file in DIMACS format
|
38 |
|
///data
|
39 |
|
///\ingroup io_group
|
40 |
|
|
41 |
34 |
/// \addtogroup dimacs_group
|
42 |
35 |
/// @{
|
43 |
36 |
|
44 |
|
|
45 |
37 |
/// DIMACS file type descriptor.
|
46 |
38 |
struct DimacsDescriptor
|
... |
... |
@@ -53,7 +45,7 @@
|
53 |
45 |
///The file type
|
54 |
46 |
Type type;
|
55 |
|
///The number of nodes on the graph
|
|
47 |
///The number of nodes in the graph
|
56 |
48 |
int nodeNum;
|
57 |
|
///The number of edges on the graph
|
|
49 |
///The number of edges in the graph
|
58 |
50 |
int edgeNum;
|
59 |
51 |
int lineShift;
|
... |
... |
@@ -65,5 +57,5 @@
|
65 |
57 |
|
66 |
58 |
///It starts seeking the begining of the file for the problem type
|
67 |
|
///and size info. The found date is returned in a special struct
|
|
59 |
///and size info. The found data is returned in a special struct
|
68 |
60 |
///that can be evaluated and passed to the appropriate reader
|
69 |
61 |
///function.
|
... |
... |
@@ -106,8 +98,8 @@
|
106 |
98 |
|
107 |
99 |
|
108 |
|
/// DIMACS min cost flow reader function.
|
|
100 |
/// DIMACS minimum cost flow reader function.
|
109 |
101 |
///
|
110 |
|
/// This function reads a min cost flow instance from DIMACS format,
|
111 |
|
/// i.e. from DIMACS files having a line starting with
|
|
102 |
/// This function reads a minimum cost flow instance from DIMACS format,
|
|
103 |
/// i.e. from a DIMACS file having a line starting with
|
112 |
104 |
/// \code
|
113 |
105 |
/// p min
|
... |
... |
@@ -231,8 +223,8 @@
|
231 |
223 |
}
|
232 |
224 |
|
233 |
|
/// DIMACS max flow reader function.
|
|
225 |
/// DIMACS maximum flow reader function.
|
234 |
226 |
///
|
235 |
|
/// This function reads a max flow instance from DIMACS format,
|
236 |
|
/// i.e. from DIMACS files having a line starting with
|
|
227 |
/// This function reads a maximum flow instance from DIMACS format,
|
|
228 |
/// i.e. from a DIMACS file having a line starting with
|
237 |
229 |
/// \code
|
238 |
230 |
/// p max
|
... |
... |
@@ -260,10 +252,10 @@
|
260 |
252 |
///
|
261 |
253 |
/// This function reads a shortest path instance from DIMACS format,
|
262 |
|
/// i.e. from DIMACS files having a line starting with
|
|
254 |
/// i.e. from a DIMACS file having a line starting with
|
263 |
255 |
/// \code
|
264 |
256 |
/// p sp
|
265 |
257 |
/// \endcode
|
266 |
258 |
/// At the beginning, \c g is cleared by \c g.clear(). The arc
|
267 |
|
/// lengths are written to \c lenght and \c s is set to the
|
|
259 |
/// lengths are written to \c length and \c s is set to the
|
268 |
260 |
/// source node.
|
269 |
261 |
///
|