Giter Site home page Giter Site logo

jason5544 / cs2-cpp Goto Github PK

View Code? Open in Web Editor NEW

This project forked from eigenpi/cs2-cpp

0.0 1.0 0.0 15 KB

Minimum-cost maximum-flow. This is a "ported to C++" version of the famous scaling push-relabel CS2 mcmf algorithm of A.V. Goldberg [1]. This C++ implementation is developed from the original C code. [1] A.V. Goldberg, "An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm," J. Algorithms, vol. 22, pp. 1-29, 1997.

Makefile 1.20% C++ 98.80%

cs2-cpp's Introduction

Cristinel Ababei
January 2009, Fargo ND
[email protected]


SUMMARY
=======

This is a C++ implementation of CS2 min-cost-max-flow scaling algorithm. 

This is intended to be one of the cleanest and simplest to use minimum-cost 
max-flow (MCMF) implementation using C++.  If you have a C++ application in 
which you need to use a MCMF algo, then this may be your most elegant bet.
See main() function for an example of how to use it.

I compiled it on Linux Fedora, using g++.  If you have any  question please 
contact Cristinel.


CREDITS
=======

This is an adapted (i.e., ported to C++) version of the faimous CS2 algo;
CS2 is the second version of scaling algorithm for minimum-cost max-flow 
problems.  For a detailed description of this famous algo, see:
A.V. Goldberg, "An Efficient Implementation of a Scaling Minimum-Cost 
Flow Algorithm", Journal of Algorithms, vol. 22, pp. 1-29, 1997.

CS2 was developed by Andrew Goldberg ([email protected]) and
Boris Cherkassky ([email protected]).

The original C version is located in cs2-4.3/


COPYRIGHT
=========

The program is available on "as is" basis.  It is not guaranteed to
be free of bugs, and the author assumes no responsibility for any
potential problems.
The original copyright notice of the C version applies to this C++
version as well.


ACADEMIA
========

If you use this C++ version in any research project and want to 
include references to it, then please use:

[1] Cristinel Ababei, C++ Implementation of Goldberg's CS2 Scaling 
    Minimum-Cost Flow Algorithm, 2009, [Online], Available: 
    http://www.ece.ndsu.nodak.edu/~cris/software.html

[2] A.V. Goldberg, An Efficient Implementation of a Scaling 
    Minimum-Cost Flow Algorithm, Journal of Algorithms, Vol. 22, 
    pp. 1-29, 1997.


FINAL NOTE
==========

If you'll ever hit it big (to be read: make a lot of money :-) ),
and this code helped you in any way, then please consider 
donating some to support my research (I need it :-) ).

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.