COIN-OR::LEMON - Graph Library

Custom Query (545 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (121 - 123 of 545)

Ticket Resolution Summary Owner Reporter
#233 fixed Todo and bug notes related to LP Balazs Dezso Peter Kovacs
Description

There are still \todo and \bug notes in the documentation of the LP tools.

See:
http://lemon.cs.elte.hu/pub/doc/latest/todo.html
http://lemon.cs.elte.hu/pub/doc/latest/bug.html

#234 fixed Port and revise Network Simplex algorithm Peter Kovacs Peter Kovacs
Description

Network Simplex is the fastest MCF implementation in LEMON. It should be ported first and the interface should be clarified. Then the remaining MCF algorithms should be ported with exactly the same interface (see #180).

#243 done Handling negative/infinity capacities in the dimacs readers Peter Kovacs Peter Kovacs
Description

In [6a17a722b50e] the readDimacsMin() function stores the negative capacities as -1 values and readDimacsMax() does not check whether the capacities are negative or not.

The attached changeset changes this behavior. It stores negative capacity values (or values that are strictly less than the lower bound) as std::numeric_limits<Capacity>::max() or std::numeric_limits<Capacity>::infinity() if it is available.

What is your opinion?

Note: See TracQuery for help on using queries.