[127] | 1 | /* -*- C++ -*- |
---|

| 2 | * |
---|

| 3 | * This file is a part of LEMON, a generic C++ optimization library |
---|

| 4 | * |
---|

| 5 | * Copyright (C) 2003-2008 |
---|

| 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 | ///\ingroup demos |
---|

| 20 | ///\file |
---|

| 21 | ///\brief Demonstrating graph input and output |
---|

| 22 | /// |
---|

[164] | 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 | /// "DigraphReader" class. |
---|

[127] | 26 | /// |
---|

[164] | 27 | /// The \c "digraph.lgf" file: |
---|

| 28 | /// \include digraph.lgf |
---|

| 29 | /// |
---|

| 30 | /// And the program which reads it: |
---|

| 31 | /// \include lgf_demo.cc |
---|

[127] | 32 | |
---|

| 33 | #include <iostream> |
---|

| 34 | #include <lemon/smart_graph.h> |
---|

| 35 | #include <lemon/lgf_reader.h> |
---|

| 36 | #include <lemon/lgf_writer.h> |
---|

| 37 | #include <lemon/random.h> |
---|

| 38 | |
---|

| 39 | |
---|

| 40 | using namespace lemon; |
---|

| 41 | |
---|

[164] | 42 | int main() { |
---|

| 43 | SmartDigraph g; |
---|

| 44 | SmartDigraph::ArcMap<int> cap(g); |
---|

| 45 | SmartDigraph::Node s, t; |
---|

[127] | 46 | |
---|

[164] | 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(); |
---|

[127] | 52 | |
---|

[164] | 53 | std::cout << "Digraph read from 'digraph.lgf'" << std::endl; |
---|

| 54 | std::cout << "Number of nodes: " << countNodes(g) << std::endl; |
---|

| 55 | std::cout << "Number of arcs: " << countArcs(g) << std::endl; |
---|

[127] | 56 | |
---|

[164] | 57 | std::cout << "We can write it to the standard output:" << std::endl; |
---|

[127] | 58 | |
---|

[164] | 59 | digraphWriter(std::cout, g). // write g to the standard output |
---|

| 60 | arcMap("capacity", cap). // write cap into 'capacity' |
---|

| 61 | node("source", s). // write s to 'source' |
---|

| 62 | node("target", t). // write t to 'target' |
---|

| 63 | run(); |
---|

[127] | 64 | |
---|

| 65 | return 0; |
---|

| 66 | } |
---|