1.1 --- a/demo/disjoint_paths_demo.cc	Sat Mar 03 16:04:50 2007 +0000
     1.2 +++ b/demo/disjoint_paths_demo.cc	Sat Mar 03 16:30:37 2007 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library
     1.6   *
     1.7 - * Copyright (C) 2003-2006
     1.8 + * Copyright (C) 2003-2007
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -70,7 +70,7 @@
    1.13    cout << "Number of edge disjoint paths: " << preflow.flowValue() << endl;
    1.14  
    1.15    graphToEps(graph, "edge_disjoint_paths.eps").
    1.16 -    title("edge disjoint path").copyright("(C) 2006 LEMON Project").drawArrows().
    1.17 +    title("edge disjoint path").copyright("(C) 2003-2007 LEMON Project").drawArrows().
    1.18      edgeColors(composeMap(functorMap(color), flow)).
    1.19      coords(coords).autoNodeScale().run();
    1.20  
    1.21 @@ -96,7 +96,7 @@
    1.22  
    1.23  
    1.24    graphToEps(sgraph, "node_disjoint_paths.eps").
    1.25 -    title("node disjoint path").copyright("(C) 2006 LEMON Project").drawArrows().
    1.26 +    title("node disjoint path").copyright("(C) 2003-2007 LEMON Project").drawArrows().
    1.27      edgeColors(composeMap(functorMap(color), sflow)).
    1.28      coords(SGraph::combinedNodeMap(coords,
    1.29  				   shiftMap(coords,