| ... | ... |
@@ -19,16 +19,17 @@ |
| 19 | 19 |
///\ingroup demos |
| 20 | 20 |
///\file |
| 21 | 21 |
///\brief Demonstrating graph input and output |
| 22 | 22 |
/// |
| 23 |
/// This program gives an example of how to load a directed graph from |
|
| 24 |
/// an \ref lgf-format "LGF" file with the \ref lemon::DigraphReader |
|
| 25 |
/// |
|
| 23 |
/// This program gives an example of how to read and write a digraph |
|
| 24 |
/// and additional maps from/to a stream or a file using the |
|
| 25 |
/// \ref lgf-format "LGF" format. |
|
| 26 | 26 |
/// |
| 27 | 27 |
/// The \c "digraph.lgf" file: |
| 28 | 28 |
/// \include digraph.lgf |
| 29 | 29 |
/// |
| 30 |
/// And the program which reads it |
|
| 30 |
/// And the program which reads it and prints the digraph to the |
|
| 31 |
/// standard output: |
|
| 31 | 32 |
/// \include lgf_demo.cc |
| 32 | 33 |
|
| 33 | 34 |
#include <iostream> |
| 34 | 35 |
#include <lemon/smart_graph.h> |
| ... | ... |
@@ -40,14 +41,19 @@ |
| 40 | 41 |
int main() {
|
| 41 | 42 |
SmartDigraph g; |
| 42 | 43 |
SmartDigraph::ArcMap<int> cap(g); |
| 43 | 44 |
SmartDigraph::Node s, t; |
| 44 |
|
|
| 45 |
digraphReader("digraph.lgf", g). // read the directed graph into g
|
|
| 46 |
arcMap("capacity", cap). // read the 'capacity' arc map into cap
|
|
| 47 |
node("source", s). // read 'source' node to s
|
|
| 48 |
node("target", t). // read 'target' node to t
|
|
| 49 |
run(); |
|
| 45 |
|
|
| 46 |
try {
|
|
| 47 |
digraphReader("digraph.lgf", g). // read the directed graph into g
|
|
| 48 |
arcMap("capacity", cap). // read the 'capacity' arc map into cap
|
|
| 49 |
node("source", s). // read 'source' node to s
|
|
| 50 |
node("target", t). // read 'target' node to t
|
|
| 51 |
run(); |
|
| 52 |
} catch (DataFormatError& error) { // check if there was any error
|
|
| 53 |
std::cerr << "Error: " << error.what() << std::endl; |
|
| 54 |
return -1; |
|
| 55 |
} |
|
| 50 | 56 |
|
| 51 | 57 |
std::cout << "A digraph is read from 'digraph.lgf'." << std::endl; |
| 52 | 58 |
std::cout << "Number of nodes: " << countNodes(g) << std::endl; |
| 53 | 59 |
std::cout << "Number of arcs: " << countArcs(g) << std::endl; |
0 comments (0 inline)