COIN-OR::LEMON - Graph Library

Changeset 2391:14a343be7a5a in lemon-0.x for demo/disjoint_paths_demo.cc


Ignore:
Timestamp:
03/03/07 17:30:37 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3222
Message:

Happy New Year to all source files!

File:
1 edited

Legend:

Unmodified
Added
Removed
  • demo/disjoint_paths_demo.cc

    r2207 r2391  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2006
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    7171
    7272  graphToEps(graph, "edge_disjoint_paths.eps").
    73     title("edge disjoint path").copyright("(C) 2006 LEMON Project").drawArrows().
     73    title("edge disjoint path").copyright("(C) 2003-2007 LEMON Project").drawArrows().
    7474    edgeColors(composeMap(functorMap(color), flow)).
    7575    coords(coords).autoNodeScale().run();
     
    9797
    9898  graphToEps(sgraph, "node_disjoint_paths.eps").
    99     title("node disjoint path").copyright("(C) 2006 LEMON Project").drawArrows().
     99    title("node disjoint path").copyright("(C) 2003-2007 LEMON Project").drawArrows().
    100100    edgeColors(composeMap(functorMap(color), sflow)).
    101101    coords(SGraph::combinedNodeMap(coords,
Note: See TracChangeset for help on using the changeset viewer.