equal
deleted
inserted
replaced
42 |
42 |
43 /// Dimacs min cost flow reader function. |
43 /// Dimacs min cost flow reader function. |
44 |
44 |
45 /// This function reads a min cost flow instance from dimacs format, |
45 /// This function reads a min cost flow instance from dimacs format, |
46 /// i.e. from dimacs files having a line starting with |
46 /// i.e. from dimacs files having a line starting with |
47 /// \code |
47 ///\code |
48 /// p "min" |
48 /// p "min" |
49 /// \endcode |
49 ///\endcode |
50 /// At the beginning \c g is cleared by \c g.clear(). The edge |
50 /// At the beginning \c g is cleared by \c g.clear(). The edge |
51 /// capacities are written to \c capacity, \c s and \c t are set to |
51 /// capacities are written to \c capacity, \c s and \c t are set to |
52 /// the source and the target nodes resp. and the cost of the edges |
52 /// the source and the target nodes resp. and the cost of the edges |
53 /// are written to \c cost. |
53 /// are written to \c cost. |
54 /// |
54 /// |
122 |
122 |
123 /// Dimacs max flow reader function. |
123 /// Dimacs max flow reader function. |
124 |
124 |
125 /// This function reads a max flow instance from dimacs format, |
125 /// This function reads a max flow instance from dimacs format, |
126 /// i.e. from dimacs files having a line starting with |
126 /// i.e. from dimacs files having a line starting with |
127 /// \code |
127 ///\code |
128 /// p "max" |
128 /// p "max" |
129 /// \endcode |
129 ///\endcode |
130 ///At the beginning \c g is cleared by \c g.clear(). The |
130 ///At the beginning \c g is cleared by \c g.clear(). The |
131 /// edge capacities are written to \c capacity and \c s and \c t are |
131 /// edge capacities are written to \c capacity and \c s and \c t are |
132 /// set to the source and the target nodes. |
132 /// set to the source and the target nodes. |
133 /// |
133 /// |
134 /// \author Marton Makai |
134 /// \author Marton Makai |
142 |
142 |
143 /// Dimacs shortest path reader function. |
143 /// Dimacs shortest path reader function. |
144 |
144 |
145 /// This function reads a shortest path instance from dimacs format, |
145 /// This function reads a shortest path instance from dimacs format, |
146 /// i.e. from dimacs files having a line starting with |
146 /// i.e. from dimacs files having a line starting with |
147 /// \code |
147 ///\code |
148 /// p "sp" |
148 /// p "sp" |
149 /// \endcode |
149 ///\endcode |
150 /// At the beginning \c g is cleared by \c g.clear(). The edge |
150 /// At the beginning \c g is cleared by \c g.clear(). The edge |
151 /// capacities are written to \c capacity and \c s is set to the |
151 /// capacities are written to \c capacity and \c s is set to the |
152 /// source node. |
152 /// source node. |
153 /// |
153 /// |
154 /// \author Marton Makai |
154 /// \author Marton Makai |
178 /// Dimacs plain graph reader function. |
178 /// Dimacs plain graph reader function. |
179 |
179 |
180 /// This function reads a graph without any designated nodes and |
180 /// This function reads a graph without any designated nodes and |
181 /// maps from dimacs format, i.e. from dimacs files having a line |
181 /// maps from dimacs format, i.e. from dimacs files having a line |
182 /// starting with |
182 /// starting with |
183 /// \code |
183 ///\code |
184 /// p "mat" |
184 /// p "mat" |
185 /// \endcode |
185 ///\endcode |
186 /// At the beginning \c g is cleared |
186 /// At the beginning \c g is cleared |
187 /// by \c g.clear(). |
187 /// by \c g.clear(). |
188 /// |
188 /// |
189 /// \author Marton Makai |
189 /// \author Marton Makai |
190 template<typename Graph> |
190 template<typename Graph> |