demo/Makefile.am
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 656 e6927fe719e6
parent 414 5a7dbeaed70e
child 611 eda12d8ac953
permissions -rw-r--r--
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
ladanyi@1
     1
EXTRA_DIST += \
deba@164
     2
	demo/CMakeLists.txt \
deba@164
     3
	demo/digraph.lgf
ladanyi@1
     4
ladanyi@1
     5
if WANT_DEMO
ladanyi@1
     6
alpar@85
     7
noinst_PROGRAMS += \
alpar@135
     8
	demo/arg_parser_demo \
alpar@135
     9
	demo/graph_to_eps_demo \
deba@127
    10
	demo/lgf_demo
ladanyi@1
    11
ladanyi@1
    12
endif WANT_DEMO
alpar@85
    13
alpar@85
    14
demo_arg_parser_demo_SOURCES = demo/arg_parser_demo.cc
alpar@135
    15
demo_graph_to_eps_demo_SOURCES = demo/graph_to_eps_demo.cc
deba@127
    16
demo_lgf_demo_SOURCES = demo/lgf_demo.cc