lemon/lemon.pc.in
author Peter Kovacs <kpeter@inf.elte.hu>
Sun, 23 Aug 2009 11:13:21 +0200
changeset 738 456fa5bc3256
parent 645 cb8270a98660
child 981 cdd2c7dad989
permissions -rw-r--r--
Much better implementation for node splitting (#311)
in ListDigraph. This solution is the same as the one that
is used in SmartDigraph. It is much faster and does not
invalidate any iterator like the former implementation.
ladanyi@1
     1
prefix=@prefix@
ladanyi@1
     2
exec_prefix=@exec_prefix@
ladanyi@1
     3
libdir=@libdir@
ladanyi@1
     4
includedir=@includedir@
ladanyi@1
     5
ladanyi@1
     6
Name: @PACKAGE_NAME@
kpeter@658
     7
Description: Library for Efficient Modeling and Optimization in Networks
ladanyi@1
     8
Version: @PACKAGE_VERSION@
ladanyi@645
     9
Libs: -L${libdir} -lemon @GLPK_LIBS@ @CPLEX_LIBS@ @SOPLEX_LIBS@ @CLP_LIBS@ @CBC_LIBS@
ladanyi@259
    10
Cflags: -I${includedir}