r191:abc5b9d0c67e
Sat, 05 Jul 2008 17:22:28
[Not Reviewed]
0 comments (0 inline)
0
1
0
17
13
| 1 | 1 |
/* -*- C++ -*- |
| 2 | 2 |
* |
| 3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library |
| 4 | 4 |
* |
| 5 | 5 |
* Copyright (C) 2003-2008 |
| 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, |
| 14 | 14 |
* express or implied, and with no claim as to its suitability for any |
| 15 | 15 |
* purpose. |
| 16 | 16 |
* |
| 17 | 17 |
*/ |
| 18 | 18 |
|
| 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> |
| 35 | 36 |
#include <lemon/lgf_reader.h> |
| 36 | 37 |
#include <lemon/lgf_writer.h> |
| 37 |
#include <lemon/random.h> |
|
| 38 |
|
|
| 39 | 38 |
|
| 40 | 39 |
using namespace lemon; |
| 41 | 40 |
|
| 42 | 41 |
int main() {
|
| 43 | 42 |
SmartDigraph g; |
| 44 | 43 |
SmartDigraph::ArcMap<int> cap(g); |
| 45 | 44 |
SmartDigraph::Node s, t; |
| 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 |
} |
|
| 46 | 56 |
|
| 47 |
digraphReader("digraph.lgf", g). // read the directeg 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 |
|
|
| 53 |
std::cout << " |
|
| 57 |
std::cout << "A digraph is read from 'digraph.lgf'." << std::endl; |
|
| 54 | 58 |
std::cout << "Number of nodes: " << countNodes(g) << std::endl; |
| 55 | 59 |
std::cout << "Number of arcs: " << countArcs(g) << std::endl; |
| 56 | 60 |
|
| 57 | 61 |
std::cout << "We can write it to the standard output:" << std::endl; |
| 58 | 62 |
|
| 59 | 63 |
digraphWriter(std::cout, g). // write g to the standard output |
| 60 | 64 |
arcMap("capacity", cap). // write cap into 'capacity'
|
| 61 | 65 |
node("source", s). // write s to 'source'
|
| 62 | 66 |
node("target", t). // write t to 'target'
|
| 63 | 67 |
run(); |
| 64 | 68 |
|
| 65 | 69 |
return 0; |
| 66 | 70 |
} |
0 comments (0 inline)