tools/lemon-0.x-to-1.x.sh
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 574 003367ffe66e
permissions -rwxr-xr-x
Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
     1 #!/bin/bash
     2 
     3 set -e
     4 
     5 if [ $# -eq 0 -o x$1 = "x-h" -o x$1 = "x-help" -o x$1 = "x--help" ]; then
     6     echo "Usage:"
     7     echo "  $0 source-file(s)"
     8     exit
     9 fi
    10 
    11 for i in $@
    12 do
    13     echo Update $i...
    14     TMP=`mktemp`
    15     sed -e "s/\<undirected graph\>/_gr_aph_label_/g"\
    16         -e "s/\<undirected graphs\>/_gr_aph_label_s/g"\
    17         -e "s/\<undirected edge\>/_ed_ge_label_/g"\
    18         -e "s/\<undirected edges\>/_ed_ge_label_s/g"\
    19         -e "s/\<directed graph\>/_digr_aph_label_/g"\
    20         -e "s/\<directed graphs\>/_digr_aph_label_s/g"\
    21         -e "s/\<directed edge\>/_ar_c_label_/g"\
    22         -e "s/\<directed edges\>/_ar_c_label_s/g"\
    23         -e "s/UGraph/_Gr_aph_label_/g"\
    24         -e "s/u[Gg]raph/_gr_aph_label_/g"\
    25         -e "s/Graph\>/_Digr_aph_label_/g"\
    26         -e "s/\<graph\>/_digr_aph_label_/g"\
    27         -e "s/Graphs\>/_Digr_aph_label_s/g"\
    28         -e "s/\<graphs\>/_digr_aph_label_s/g"\
    29         -e "s/\([Gg]\)raph\([a-z]\)/_\1r_aph_label_\2/g"\
    30         -e "s/\([a-z_]\)graph/\1_gr_aph_label_/g"\
    31         -e "s/Graph/_Digr_aph_label_/g"\
    32         -e "s/graph/_digr_aph_label_/g"\
    33         -e "s/UEdge/_Ed_ge_label_/g"\
    34         -e "s/u[Ee]dge/_ed_ge_label_/g"\
    35         -e "s/IncEdgeIt/_In_cEd_geIt_label_/g"\
    36         -e "s/Edge\>/_Ar_c_label_/g"\
    37         -e "s/\<edge\>/_ar_c_label_/g"\
    38         -e "s/_edge\>/__ar_c_label_/g"\
    39         -e "s/Edges\>/_Ar_c_label_s/g"\
    40         -e "s/\<edges\>/_ar_c_label_s/g"\
    41         -e "s/_edges\>/__ar_c_label_s/g"\
    42         -e "s/\([Ee]\)dge\([a-z]\)/_\1d_ge_label_\2/g"\
    43         -e "s/\([a-z]\)edge/\1_ed_ge_label_/g"\
    44         -e "s/Edge/_Ar_c_label_/g"\
    45         -e "s/edge/_ar_c_label_/g"\
    46         -e "s/A[Nn]ode/_Re_d_label_/g"\
    47         -e "s/B[Nn]ode/_Blu_e_label_/g"\
    48         -e "s/A-[Nn]ode/_Re_d_label_/g"\
    49         -e "s/B-[Nn]ode/_Blu_e_label_/g"\
    50         -e "s/a[Nn]ode/_re_d_label_/g"\
    51         -e "s/b[Nn]ode/_blu_e_label_/g"\
    52         -e "s/\<UGRAPH_TYPEDEFS\([ \t]*([ \t]*\)typename[ \t]/TEMPLATE__GR_APH_TY_PEDE_FS_label_\1/g"\
    53         -e "s/\<GRAPH_TYPEDEFS\([ \t]*([ \t]*\)typename[ \t]/TEMPLATE__DIGR_APH_TY_PEDE_FS_label_\1/g"\
    54         -e "s/\<UGRAPH_TYPEDEFS\>/_GR_APH_TY_PEDE_FS_label_/g"\
    55         -e "s/\<GRAPH_TYPEDEFS\>/_DIGR_APH_TY_PEDE_FS_label_/g"\
    56         -e "s/_Digr_aph_label_/Digraph/g"\
    57         -e "s/_digr_aph_label_/digraph/g"\
    58         -e "s/_Gr_aph_label_/Graph/g"\
    59         -e "s/_gr_aph_label_/graph/g"\
    60         -e "s/_Ar_c_label_/Arc/g"\
    61         -e "s/_ar_c_label_/arc/g"\
    62         -e "s/_Ed_ge_label_/Edge/g"\
    63         -e "s/_ed_ge_label_/edge/g"\
    64         -e "s/_In_cEd_geIt_label_/IncEdgeIt/g"\
    65         -e "s/_Re_d_label_/Red/g"\
    66         -e "s/_Blu_e_label_/Blue/g"\
    67         -e "s/_re_d_label_/red/g"\
    68         -e "s/_blu_e_label_/blue/g"\
    69         -e "s/_GR_APH_TY_PEDE_FS_label_/GRAPH_TYPEDEFS/g"\
    70         -e "s/_DIGR_APH_TY_PEDE_FS_label_/DIGRAPH_TYPEDEFS/g"\
    71         -e "s/\<digraph_adaptor\.h\>/adaptors.h/g"\
    72         -e "s/\<digraph_utils\.h\>/core.h/g"\
    73         -e "s/\<digraph_reader\.h\>/lgf_reader.h/g"\
    74         -e "s/\<digraph_writer\.h\>/lgf_writer.h/g"\
    75         -e "s/\<topology\.h\>/connectivity.h/g"\
    76         -e "s/DigraphToEps/GraphToEps/g"\
    77         -e "s/digraphToEps/graphToEps/g"\
    78         -e "s/\<DefPredMap\>/SetPredMap/g"\
    79         -e "s/\<DefDistMap\>/SetDistMap/g"\
    80         -e "s/\<DefReachedMap\>/SetReachedMap/g"\
    81         -e "s/\<DefProcessedMap\>/SetProcessedMap/g"\
    82         -e "s/\<DefHeap\>/SetHeap/g"\
    83         -e "s/\<DefStandardHeap\>/SetStandradHeap/g"\
    84         -e "s/\<DefOperationTraits\>/SetOperationTraits/g"\
    85         -e "s/\<DefProcessedMapToBeDefaultMap\>/SetStandardProcessedMap/g"\
    86         -e "s/\<copyGraph\>/graphCopy/g"\
    87         -e "s/\<copyDigraph\>/digraphCopy/g"\
    88         -e "s/\<HyperCubeDigraph\>/HypercubeGraph/g"\
    89         -e "s/\<IntegerMap\>/RangeMap/g"\
    90         -e "s/\<integerMap\>/rangeMap/g"\
    91         -e "s/\<\([sS]\)tdMap\>/\1parseMap/g"\
    92         -e "s/\<\([Ff]\)unctorMap\>/\1unctorToMap/g"\
    93         -e "s/\<\([Mm]\)apFunctor\>/\1apToFunctor/g"\
    94         -e "s/\<\([Ff]\)orkWriteMap\>/\1orkMap/g"\
    95         -e "s/\<StoreBoolMap\>/LoggerBoolMap/g"\
    96         -e "s/\<storeBoolMap\>/loggerBoolMap/g"\
    97         -e "s/\<InvertableMap\>/CrossRefMap/g"\
    98         -e "s/\<invertableMap\>/crossRefMap/g"\
    99         -e "s/\<DescriptorMap\>/RangeIdMap/g"\
   100         -e "s/\<descriptorMap\>/rangeIdMap/g"\
   101         -e "s/\<BoundingBox\>/Box/g"\
   102         -e "s/\<readNauty\>/readNautyGraph/g"\
   103         -e "s/\<RevDigraphAdaptor\>/ReverseDigraph/g"\
   104         -e "s/\<revDigraphAdaptor\>/reverseDigraph/g"\
   105         -e "s/\<SubDigraphAdaptor\>/SubDigraph/g"\
   106         -e "s/\<subDigraphAdaptor\>/subDigraph/g"\
   107         -e "s/\<SubGraphAdaptor\>/SubGraph/g"\
   108         -e "s/\<subGraphAdaptor\>/subGraph/g"\
   109         -e "s/\<NodeSubDigraphAdaptor\>/FilterNodes/g"\
   110         -e "s/\<nodeSubDigraphAdaptor\>/filterNodes/g"\
   111         -e "s/\<ArcSubDigraphAdaptor\>/FilterArcs/g"\
   112         -e "s/\<arcSubDigraphAdaptor\>/filterArcs/g"\
   113         -e "s/\<UndirDigraphAdaptor\>/Undirector/g"\
   114         -e "s/\<undirDigraphAdaptor\>/undirector/g"\
   115         -e "s/\<ResDigraphAdaptor\>/ResidualDigraph/g"\
   116         -e "s/\<resDigraphAdaptor\>/residualDigraph/g"\
   117         -e "s/\<SplitDigraphAdaptor\>/SplitNodes/g"\
   118         -e "s/\<splitDigraphAdaptor\>/splitNodes/g"\
   119         -e "s/\<SubGraphAdaptor\>/SubGraph/g"\
   120         -e "s/\<subGraphAdaptor\>/subGraph/g"\
   121         -e "s/\<NodeSubGraphAdaptor\>/FilterNodes/g"\
   122         -e "s/\<nodeSubGraphAdaptor\>/filterNodes/g"\
   123         -e "s/\<ArcSubGraphAdaptor\>/FilterEdges/g"\
   124         -e "s/\<arcSubGraphAdaptor\>/filterEdges/g"\
   125         -e "s/\<DirGraphAdaptor\>/Orienter/g"\
   126         -e "s/\<dirGraphAdaptor\>/orienter/g"\
   127         -e "s/\<LpCplex\>/CplexLp/g"\
   128         -e "s/\<MipCplex\>/CplexMip/g"\
   129         -e "s/\<LpGlpk\>/GlpkLp/g"\
   130         -e "s/\<MipGlpk\>/GlpkMip/g"\
   131         -e "s/\<LpSoplex\>/SoplexLp/g"\
   132     <$i > $TMP
   133     mv $TMP $i
   134 done