[med-svn] [maxflow] 01/02: Imported Upstream version 3.0.4
Gert Wollny
gert-guest at moszumanska.debian.org
Tue Jul 21 17:37:47 UTC 2015
This is an automated email from the git hooks/post-receive script.
gert-guest pushed a commit to branch master
in repository maxflow.
commit f39ce638406833b905390b9dc633c39257a5c252
Author: Gert Wollny <gw.fossdev at gmail.com>
Date: Tue Jul 21 19:35:41 2015 +0200
Imported Upstream version 3.0.4
---
.gitignore | 3 +
CHANGES.TXT | 51 +++
CMakeLists.txt | 92 ++++++
GPL.TXT | 674 ++++++++++++++++++++++++++++++++++++++++
README.md | 129 ++++++++
maxflow.cpp | 34 ++
maxflow.h | 45 +++
maxflow.pc.cmake | 11 +
maxflow/CMakeLists.txt | 22 ++
maxflow/block.h | 320 +++++++++++++++++++
maxflow/graph.cpp | 819 +++++++++++++++++++++++++++++++++++++++++++++++++
maxflow/graph.h | 511 ++++++++++++++++++++++++++++++
test_maxflow.cpp | 211 +++++++++++++
13 files changed, 2922 insertions(+)
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..04d596f
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,3 @@
+build
+*~
+
diff --git a/CHANGES.TXT b/CHANGES.TXT
new file mode 100644
index 0000000..d69fa59
--- /dev/null
+++ b/CHANGES.TXT
@@ -0,0 +1,51 @@
+List of changes from version 3.03:
+
+- Add CMake build files
+- Add simple unit test as test-maxflow executable
+- move some code around to put all graph implementation code into one file
+- make it compile to a shared library
+- provide the standard instanciations that were in "instances.inc" as typedefs
+ they are the ones that are provided by the shared library
+- silence a warning about assignment in "if"
+- put header files into a maxflow subdirectory to avoid possible conflicts with
+ other header files named "graph.h"
+
+List of changes from version 3.02:
+
+- put under GPL license
+
+List of changes from version 3.01:
+
+- fixed a bug: using add_node() or add_edge() after the first maxflow() with the reuse_trees option
+ could have caused segmentation fault (if nodes or arcs are reallocated). Thanks to Jan Lellmann for pointing out this bug.
+- updated block.h to suppress compilation warnings
+
+List of changes from version 3.0:
+- Moved line
+ #include "instances.inc"
+to the end of cpp files to make it compile under GNU c++ compilers 4.2(?) and above
+
+List of changes from version 2.2:
+
+- Added functions for accessing graph structure, residual capacities, etc.
+ (They are needed for implementing maxflow-based algorithms such as primal-dual algorithm for convex MRFs.)
+- Added option of reusing trees.
+- node_id's are now integers starting from 0. Thus, it is not necessary to store node_id's in a separate array.
+- Capacity types are now templated.
+- Fixed bug in block.h. (After Block<type>::Reset, ScanFirst() and ScanNext() did not work properly).
+- Implementation with a forward star representation of the graph is no longer supported. (It needs less memory, but slightly slower than adjacency list representation.) If you still wish to use it, download version 2.2.
+- Note: version 3.0 is released under a different license than version 2.2.
+
+List of changes from version 2.1:
+
+- Put the code under GPL license
+
+List of changes from version 2.02:
+
+- Fixed a bug in the implementation that uses forward star representation
+
+List of changes from version 2.01:
+
+- Added new interface function - Graph::add_tweights(Node_id, captype, captype)
+ (necessary for the "ENERGY" software package)
+
diff --git a/CMakeLists.txt b/CMakeLists.txt
new file mode 100644
index 0000000..cba0a10
--- /dev/null
+++ b/CMakeLists.txt
@@ -0,0 +1,92 @@
+# This file is part of MAXFLOW.
+
+# MAXFLOW is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+
+# MAXFLOW is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+
+# You should have received a copy of the GNU General Public License
+# along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+
+
+PROJECT("maxflow")
+
+CMAKE_MINIMUM_REQUIRED(VERSION 2.8.5 FATAL_ERROR)
+
+if(COMMAND cmake_policy)
+ cmake_policy(SET CMP0003 NEW)
+ cmake_policy(SET CMP0012 NEW)
+ IF(${CMAKE_VERSION} VERSION_GREATER 3.0.0)
+ cmake_policy(SET CMP0042 NEW)
+ ENDIF()
+endif(COMMAND cmake_policy)
+
+
+SET(PACKAGE_NAME "maxflow")
+SET(MAJOR_VERSION 3)
+SET(MINOR_VERSION 0)
+SET(MICRO_VERSION 4)
+SET(INTERFACE_AGE 4)
+SET(BINARY_AGE 4)
+
+
+SET(PACKAGE_VERSION "${MAJOR_VERSION}.${MINOR_VERSION}.${MICRO_VERSION}")
+SET(VERSION "${MAJOR_VERSION}.${MINOR_VERSION}")
+SET(PACKAGE_NAME "${PACKAGE_NAME}-${VERSION}")
+SET(prefix ${CMAKE_INSTALL_PREFIX})
+
+
+MATH(EXPR MAXFLOW_CURRENT "${MICRO_VERSION} - ${BINARY_AGE}")
+SET(MAXFLOW_REVISION ${INTERFACE_AGE})
+MATH(EXPR MAXFLOW_AGE "${BINARY_AGE} - ${INTERFACE_AGE}")
+
+SET(LIBRARY_SOVERSION_INFO "${MAXFLOW_CURRENT}")
+SET(LIBRARY_VERSION_INFO "${MAXFLOW_CURRENT}.${MAXFLOW_AGE}.${MAXFLOW_REVISION}")
+
+INCLUDE(GNUInstallDirs)
+
+SET(INCLUDE_INSTALL_PATH ${CMAKE_INSTALL_INCLUDEDIR}/maxflow-${VERSION})
+
+
+ADD_SUBDIRECTORY(maxflow)
+INCLUDE_DIRECTORIES(${CMAKE_CURRENT_SOURCE_DIR})
+
+ADD_LIBRARY(maxflow SHARED maxflow.cpp)
+SET_TARGET_PROPERTIES(maxflow PROPERTIES
+ SOVERSION ${LIBRARY_SOVERSION_INFO}
+ VERSION ${LIBRARY_VERSION_INFO}
+ )
+
+INSTALL(TARGETS maxflow
+ EXPORT MaxFlow
+ RUNTIME DESTINATION "${CMAKE_INSTALL_BINDIR}"
+ LIBRARY DESTINATION "${CMAKE_INSTALL_LIBDIR}"
+ ARCHIVE DESTINATION "${CMAKE_INSTALL_LIBDIR}")
+
+
+
+SET(LIBRARY_INSTALL_PATH ${CMAKE_INSTALL_LIBDIR})
+
+
+
+CONFIGURE_FILE(${CMAKE_CURRENT_SOURCE_DIR}/maxflow.pc.cmake ${CMAKE_CURRENT_BINARY_DIR}/maxflow.pc)
+
+INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/maxflow.pc DESTINATION "${CMAKE_INSTALL_FULL_LIBDIR}/pkgconfig")
+SET(MAXFLOW_BASE_HEADER
+ maxflow.h
+ )
+
+INSTALL(FILES ${MAXFLOW_BASE_HEADER} DESTINATION ${INCLUDE_INSTALL_PATH})
+
+
+
+ADD_EXECUTABLE(test-maxflow test_maxflow.cpp)
+TARGET_LINK_LIBRARIES(test-maxflow maxflow)
+
+ENABLE_TESTING()
+ADD_TEST(maxflow test-maxflow)
\ No newline at end of file
diff --git a/GPL.TXT b/GPL.TXT
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/GPL.TXT
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..2dba7bc
--- /dev/null
+++ b/README.md
@@ -0,0 +1,129 @@
+# MAXFLOW - software for computing mincut/maxflow in a graph #
+# Version 3.04 #
+
+The original implementation can be found at
+
+ http://pub.ist.ac.at/~vnk/software.html
+
+and was implemented by
+
+ Yuri Boykov (yuri at csd.uwo.ca)
+ Vladimir Kolmogorov (vnk at ist.ac.at)
+ 2001-2006
+
+## Introduction.
+
+This software library implements the maxflow algorithm described in
+
+ "An Experimental Comparison of Min-Cut/Max-Flow Algorithms
+ for Energy Minimization in Vision."
+ Yuri Boykov and Vladimir Kolmogorov.
+ In IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI),
+ September 2004
+ http://dx.doi.org/10.1109/TPAMI.2004.60
+
+This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov
+at Siemens Corporate Research. To make it available for public use,
+it was later reimplemented by Vladimir Kolmogorov based on open publications.
+
+If you use this software for research purposes, you should cite
+the aforementioned paper in any resulting publication.
+
+----------------------------------------------------------------------
+
+### Reusing trees
+
+Starting with version 3.0, there is a also an option of reusing search
+trees from one maxflow computation to the next, as described in
+
+ "Efficiently Solving Dynamic Markov Random Fields Using Graph Cuts."
+ Pushmeet Kohli and Philip H.S. Torr
+ International Conference on Computer Vision (ICCV), 2005
+
+If you use this option, you should cite
+the aforementioned paper in any resulting publication.
+
+Tested under windows, Visual C++ 6.0 compiler and unix (SunOS 5.8
+and RedHat Linux 7.0, Gentoo Linux, GNU C++ compiler).
+
+## License & disclaimer.
+
+ Copyright 2001-2006 Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca).
+
+ This software is under the GPL license.
+ If you require another license, you may consider using version 2.21
+ (which implements exactly the same algorithm, but does not have
+ the option of reusing search trees).
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+### Example usage.
+
+This section shows how to use the library to compute
+a minimum cut on the following graph:
+
+ SOURCE
+ / \
+ 1/ \2
+ / 3 \
+ node0 -----> node1
+ | <----- |
+ | 4 |
+ \ /
+ 5\ /6
+ \ /
+ SINK
+
+
+----
+
+ #include <stdio.h>
+ #include <maxflow/graph.h>
+
+ int main()
+ {
+ typedef Graph<int,int,int> GraphType;
+ GraphType *g = new GraphType(/*estimated # of nodes*/ 2, /*estimated # of edges*/ 1);
+
+ g -> add_node();
+ g -> add_node();
+
+ g -> add_tweights( 0, /* capacities */ 1, 5 );
+ g -> add_tweights( 1, /* capacities */ 2, 6 );
+ g -> add_edge( 0, 1, /* capacities */ 3, 4 );
+
+ int flow = g -> maxflow();
+
+ printf("Flow = %d\n", flow);
+ printf("Minimum cut:\n");
+ if (g->what_segment(0) == GraphType::SOURCE)
+ printf("node0 is in the SOURCE set\n");
+ else
+ printf("node0 is in the SINK set\n");
+ if (g->what_segment(1) == GraphType::SOURCE)
+ printf("node1 is in the SOURCE set\n");
+ else
+ printf("node1 is in the SINK set\n");
+
+ delete g;
+
+ return 0;
+ }
+
+
+### Additional notes
+
+The build system, unit tests, and creation of a shared library was done by Gert Wollny <gw.fossdev at gmail.com> here
+in this github repository.
+
diff --git a/maxflow.cpp b/maxflow.cpp
new file mode 100644
index 0000000..711eb90
--- /dev/null
+++ b/maxflow.cpp
@@ -0,0 +1,34 @@
+/* maxflow.cpp */
+/*
+ Copyright 2006-2015
+ Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca)
+
+ This file is part of MAXFLOW.
+
+ MAXFLOW is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ MAXFLOW is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+
+#include <stdio.h>
+
+#define MAXFLOW_INCLUDE_TEMPLATE_IMPLEMENTATION 1
+#include <maxflow.h>
+
+namespace maxflow {
+template class Graph<int,int,int>;
+template class Graph<short,int,int>;
+template class Graph<float,float,float>;
+template class Graph<double,double,double>;
+}
+
diff --git a/maxflow.h b/maxflow.h
new file mode 100644
index 0000000..713d7b0
--- /dev/null
+++ b/maxflow.h
@@ -0,0 +1,45 @@
+/*
+ Copyright 2006-2015
+ Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca)
+
+ This file is part of MAXFLOW.
+
+ MAXFLOW is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ MAXFLOW is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+
+#ifndef maxflow_h
+#define maxflow_h
+
+#include <maxflow/block.h>
+#include <maxflow/graph.h>
+
+
+namespace maxflow {
+
+typedef Graph<int,int,int> Graph_III;
+typedef Graph<short,int,int> Graph_SII;
+typedef Graph<float,float,float> Graph_FFF;
+typedef Graph<double,double,double> Graph_DDD;
+
+}
+
+// define this if you want to instanciate a graph different from
+// the above
+#ifdef MAXFLOW_INCLUDE_TEMPLATE_IMPLEMENTATION
+#include <maxflow/graph.cpp>
+#endif
+
+
+#endif
diff --git a/maxflow.pc.cmake b/maxflow.pc.cmake
new file mode 100644
index 0000000..ec139d8
--- /dev/null
+++ b/maxflow.pc.cmake
@@ -0,0 +1,11 @@
+prefix=@prefix@
+exec_prefix=${prefix}
+libdir=${prefix}/@LIBRARY_INSTALL_PATH@
+includedir=${prefix}/@INCLUDE_INSTALL_PATH@
+
+Name: maxflow
+Description: A library implementing the max-flow/min-cut algorithm
+Version: @PACKAGE_VERSION@
+Conflicts:
+Libs: -lmaxflow -L${prefix}/@LIBRARY_INSTALL_PATH@
+Cflags: -I${prefix}/@INCLUDE_INSTALL_PATH@
diff --git a/maxflow/CMakeLists.txt b/maxflow/CMakeLists.txt
new file mode 100644
index 0000000..4a1c278
--- /dev/null
+++ b/maxflow/CMakeLists.txt
@@ -0,0 +1,22 @@
+# This file is part of MAXFLOW.
+
+# MAXFLOW is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+
+# MAXFLOW is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+
+# You should have received a copy of the GNU General Public License
+# along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+
+SET(MAXFLOW_HEADER
+ block.h
+ graph.h
+ graph.cpp)
+
+INSTALL(FILES ${MAXFLOW_HEADER} DESTINATION "${INCLUDE_INSTALL_PATH}/maxflow")
+
diff --git a/maxflow/block.h b/maxflow/block.h
new file mode 100644
index 0000000..87a7216
--- /dev/null
+++ b/maxflow/block.h
@@ -0,0 +1,320 @@
+/*
+ Copyright 2006-2015
+ Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca)
+
+ This file is part of MAXFLOW.
+
+ MAXFLOW is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ MAXFLOW is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+*/
+
+/* block.h */
+/* Vladimir Kolmogorov vnk at ist.ac.at */
+/* Last modified 08/05/2012 */
+/*
+ Template classes Block and DBlock
+ Implement adding and deleting items of the same type in blocks.
+
+ If there there are many items then using Block or DBlock
+ is more efficient than using 'new' and 'delete' both in terms
+ of memory and time since
+ (1) On some systems there is some minimum amount of memory
+ that 'new' can allocate (e.g., 64), so if items are
+ small that a lot of memory is wasted.
+ (2) 'new' and 'delete' are designed for items of varying size.
+ If all items has the same size, then an algorithm for
+ adding and deleting can be made more efficient.
+ (3) All Block and DBlock functions are inline, so there are
+ no extra function calls.
+
+ Differences between Block and DBlock:
+ (1) DBlock allows both adding and deleting items,
+ whereas Block allows only adding items.
+ (2) Block has an additional operation of scanning
+ items added so far (in the order in which they were added).
+ (3) Block allows to allocate several consecutive
+ items at a time, whereas DBlock can add only a single item.
+
+ Note that no constructors or destructors are called for items.
+
+ Example usage for items of type 'MyType':
+
+ ///////////////////////////////////////////////////
+ #include "block.h"
+ #define BLOCK_SIZE 1024
+ typedef struct { int a, b; } MyType;
+ MyType *ptr, *array[10000];
+
+ ...
+
+ Block<MyType> *block = new Block<MyType>(BLOCK_SIZE);
+
+ // adding items
+ for (int i=0; i<sizeof(array); i++)
+ {
+ ptr = block -> New();
+ ptr -> a = ptr -> b = rand();
+ }
+
+ // reading items
+ for (ptr=block->ScanFirst(); ptr; ptr=block->ScanNext())
+ {
+ printf("%d %d\n", ptr->a, ptr->b);
+ }
+
+ delete block;
+
+ ...
+
+ DBlock<MyType> *dblock = new DBlock<MyType>(BLOCK_SIZE);
+
+ // adding items
+ for (int i=0; i<sizeof(array); i++)
+ {
+ array[i] = dblock -> New();
+ }
+
+ // deleting items
+ for (int i=0; i<sizeof(array); i+=2)
+ {
+ dblock -> Delete(array[i]);
+ }
+
+ // adding items
+ for (int i=0; i<sizeof(array); i++)
+ {
+ array[i] = dblock -> New();
+ }
+
+ delete dblock;
+
+ ///////////////////////////////////////////////////
+
+ Note that DBlock deletes items by marking them as
+ empty (i.e., by adding them to the list of free items),
+ so that this memory could be used for subsequently
+ added items. Thus, at each moment the memory allocated
+ is determined by the maximum number of items allocated
+ simultaneously at earlier moments. All memory is
+ deallocated only when the destructor is called.
+*/
+
+#ifndef __BLOCK_H__
+#define __BLOCK_H__
+
+#include <stdlib.h>
+
+/***********************************************************************/
+/***********************************************************************/
+/***********************************************************************/
+
+namespace maxflow {
+
+template <class Type> class Block
+{
+public:
+ /* Constructor. Arguments are the block size and
+ (optionally) the pointer to the function which
+ will be called if allocation failed; the message
+ passed to this function is "Not enough memory!" */
+ Block(int size, void (*err_function)(const char *) = NULL) { first = last = NULL; block_size = size; error_function = err_function; }
+
+ /* Destructor. Deallocates all items added so far */
+ ~Block() { while (first) { block *next = first -> next; delete[] ((char*)first); first = next; } }
+
+ /* Allocates 'num' consecutive items; returns pointer
+ to the first item. 'num' cannot be greater than the
+ block size since items must fit in one block */
+ Type *New(int num = 1)
+ {
+ Type *t;
+
+ if (!last || last->current + num > last->last)
+ {
+ if (last && last->next) last = last -> next;
+ else
+ {
+ block *next = (block *) new char [sizeof(block) + (block_size-1)*sizeof(Type)];
+ if (!next) { if (error_function) (*error_function)("Not enough memory!"); exit(1); }
+ if (last) last -> next = next;
+ else first = next;
+ last = next;
+ last -> current = & ( last -> data[0] );
+ last -> last = last -> current + block_size;
+ last -> next = NULL;
+ }
+ }
+
+ t = last -> current;
+ last -> current += num;
+ return t;
+ }
+
+ /* Returns the first item (or NULL, if no items were added) */
+ Type *ScanFirst()
+ {
+ for (scan_current_block=first; scan_current_block; scan_current_block = scan_current_block->next)
+ {
+ scan_current_data = & ( scan_current_block -> data[0] );
+ if (scan_current_data < scan_current_block -> current) return scan_current_data ++;
+ }
+ return NULL;
+ }
+
+ /* Returns the next item (or NULL, if all items have been read)
+ Can be called only if previous ScanFirst() or ScanNext()
+ call returned not NULL. */
+ Type *ScanNext()
+ {
+ while (scan_current_data >= scan_current_block -> current)
+ {
+ scan_current_block = scan_current_block -> next;
+ if (!scan_current_block) return NULL;
+ scan_current_data = & ( scan_current_block -> data[0] );
+ }
+ return scan_current_data ++;
+ }
+
+ struct iterator; // for overlapping scans
+ Type *ScanFirst(iterator& i)
+ {
+ for (i.scan_current_block=first; i.scan_current_block; i.scan_current_block = i.scan_current_block->next)
+ {
+ i.scan_current_data = & ( i.scan_current_block -> data[0] );
+ if (i.scan_current_data < i.scan_current_block -> current) return i.scan_current_data ++;
+ }
+ return NULL;
+ }
+ Type *ScanNext(iterator& i)
+ {
+ while (i.scan_current_data >= i.scan_current_block -> current)
+ {
+ i.scan_current_block = i.scan_current_block -> next;
+ if (!i.scan_current_block) return NULL;
+ i.scan_current_data = & ( i.scan_current_block -> data[0] );
+ }
+ return i.scan_current_data ++;
+ }
+
+ /* Marks all elements as empty */
+ void Reset()
+ {
+ block *b;
+ if (!first) return;
+ for (b=first; ; b=b->next)
+ {
+ b -> current = & ( b -> data[0] );
+ if (b == last) break;
+ }
+ last = first;
+ }
+
+/***********************************************************************/
+
+private:
+
+ typedef struct block_st
+ {
+ Type *current, *last;
+ struct block_st *next;
+ Type data[1];
+ } block;
+
+ int block_size;
+ block *first;
+ block *last;
+public:
+ struct iterator
+ {
+ block *scan_current_block;
+ Type *scan_current_data;
+ };
+private:
+ block *scan_current_block;
+ Type *scan_current_data;
+
+ void (*error_function)(const char *);
+};
+
+/***********************************************************************/
+/***********************************************************************/
+/***********************************************************************/
+
+template <class Type> class DBlock
+{
+public:
+ /* Constructor. Arguments are the block size and
+ (optionally) the pointer to the function which
+ will be called if allocation failed; the message
+ passed to this function is "Not enough memory!" */
+ DBlock(int size, void (*err_function)(const char *) = NULL) { first = NULL; first_free = NULL; block_size = size; error_function = err_function; }
+
+ /* Destructor. Deallocates all items added so far */
+ ~DBlock() { while (first) { block *next = first -> next; delete[] ((char*)first); first = next; } }
+
+ /* Allocates one item */
+ Type *New()
+ {
+ block_item *item;
+
+ if (!first_free)
+ {
+ block *next = first;
+ first = (block *) new char [sizeof(block) + (block_size-1)*sizeof(block_item)];
+ if (!first) { if (error_function) (*error_function)("Not enough memory!"); exit(1); }
+ first_free = & (first -> data[0] );
+ for (item=first_free; item<first_free+block_size-1; item++)
+ item -> next_free = item + 1;
+ item -> next_free = NULL;
+ first -> next = next;
+ }
+
+ item = first_free;
+ first_free = item -> next_free;
+ return (Type *) item;
+ }
+
+ /* Deletes an item allocated previously */
+ void Delete(Type *t)
+ {
+ ((block_item *) t) -> next_free = first_free;
+ first_free = (block_item *) t;
+ }
+
+/***********************************************************************/
+
+private:
+
+ typedef union block_item_st
+ {
+ Type t;
+ block_item_st *next_free;
+ } block_item;
+
+ typedef struct block_st
+ {
+ struct block_st *next;
+ block_item data[1];
+ } block;
+
+ int block_size;
+ block *first;
+ block_item *first_free;
+
+ void (*error_function)(const char *);
+};
+
+} // end namespace maxflow
+
+#endif
+
diff --git a/maxflow/graph.cpp b/maxflow/graph.cpp
new file mode 100644
index 0000000..40e348c
--- /dev/null
+++ b/maxflow/graph.cpp
@@ -0,0 +1,819 @@
+/* graph.cpp provides the implementation of the template methods */
+/*
+ Copyright 2006-2015
+ Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca)
+
+ This file is part of MAXFLOW.
+
+ MAXFLOW is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ MAXFLOW is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "graph.h"
+
+namespace maxflow {
+
+#define TERMINAL ( (arc *) 1 ) /* to terminal */
+#define ORPHAN ( (arc *) 2 ) /* orphan */
+
+template <typename captype, typename tcaptype, typename flowtype>
+ Graph<captype, tcaptype, flowtype>::Graph(int node_num_max, int edge_num_max, void (*err_function)(const char *))
+ : node_num(0),
+ nodeptr_block(NULL),
+ error_function(err_function)
+{
+ if (node_num_max < 16) node_num_max = 16;
+ if (edge_num_max < 16) edge_num_max = 16;
+
+ nodes = (node*) malloc(node_num_max*sizeof(node));
+ arcs = (arc*) malloc(2*edge_num_max*sizeof(arc));
+ if (!nodes || !arcs) { if (error_function) (*error_function)("Not enough memory!"); exit(1); }
+
+ node_last = nodes;
+ node_max = nodes + node_num_max;
+ arc_last = arcs;
+ arc_max = arcs + 2*edge_num_max;
+
+ maxflow_iteration = 0;
+ flow = 0;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ Graph<captype,tcaptype,flowtype>::~Graph()
+{
+ if (nodeptr_block)
+ {
+ delete nodeptr_block;
+ nodeptr_block = NULL;
+ }
+ free(nodes);
+ free(arcs);
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::reset()
+{
+ node_last = nodes;
+ arc_last = arcs;
+ node_num = 0;
+
+ if (nodeptr_block)
+ {
+ delete nodeptr_block;
+ nodeptr_block = NULL;
+ }
+
+ maxflow_iteration = 0;
+ flow = 0;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::reallocate_nodes(int num)
+{
+ int node_num_max = (int)(node_max - nodes);
+ node* nodes_old = nodes;
+
+ node_num_max += node_num_max / 2;
+ if (node_num_max < node_num + num) node_num_max = node_num + num;
+ nodes = (node*) realloc(nodes_old, node_num_max*sizeof(node));
+ if (!nodes) { if (error_function) (*error_function)("Not enough memory!"); exit(1); }
+
+ node_last = nodes + node_num;
+ node_max = nodes + node_num_max;
+
+ if (nodes != nodes_old)
+ {
+ node* i;
+ arc* a;
+ for (i=nodes; i<node_last; i++)
+ {
+ if (i->next) i->next = (node*) ((char*)i->next + (((char*) nodes) - ((char*) nodes_old)));
+ }
+ for (a=arcs; a<arc_last; a++)
+ {
+ a->head = (node*) ((char*)a->head + (((char*) nodes) - ((char*) nodes_old)));
+ }
+ }
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::reallocate_arcs()
+{
+ int arc_num_max = (int)(arc_max - arcs);
+ int arc_num = (int)(arc_last - arcs);
+ arc* arcs_old = arcs;
+
+ arc_num_max += arc_num_max / 2; if (arc_num_max & 1) arc_num_max ++;
+ arcs = (arc*) realloc(arcs_old, arc_num_max*sizeof(arc));
+ if (!arcs) { if (error_function) (*error_function)("Not enough memory!"); exit(1); }
+
+ arc_last = arcs + arc_num;
+ arc_max = arcs + arc_num_max;
+
+ if (arcs != arcs_old)
+ {
+ node* i;
+ arc* a;
+ for (i=nodes; i<node_last; i++)
+ {
+ if (i->first) i->first = (arc*) ((char*)i->first + (((char*) arcs) - ((char*) arcs_old)));
+ if (i->parent && i->parent != ORPHAN && i->parent != TERMINAL) i->parent = (arc*) ((char*)i->parent + (((char*) arcs) - ((char*) arcs_old)));
+ }
+ for (a=arcs; a<arc_last; a++)
+ {
+ if (a->next) a->next = (arc*) ((char*)a->next + (((char*) arcs) - ((char*) arcs_old)));
+ a->sister = (arc*) ((char*)a->sister + (((char*) arcs) - ((char*) arcs_old)));
+ }
+ }
+}
+
+#define INFINITE_D ((int)(((unsigned)-1)/2)) /* infinite distance to the terminal */
+
+/***********************************************************************/
+
+/*
+ Functions for processing active list.
+ i->next points to the next node in the list
+ (or to i, if i is the last node in the list).
+ If i->next is NULL iff i is not in the list.
+
+ There are two queues. Active nodes are added
+ to the end of the second queue and read from
+ the front of the first queue. If the first queue
+ is empty, it is replaced by the second queue
+ (and the second queue becomes empty).
+*/
+
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::set_active(node *i)
+{
+ if (!i->next)
+ {
+ /* it's not in the list yet */
+ if (queue_last[1]) queue_last[1] -> next = i;
+ else queue_first[1] = i;
+ queue_last[1] = i;
+ i -> next = i;
+ }
+}
+
+/*
+ Returns the next active node.
+ If it is connected to the sink, it stays in the list,
+ otherwise it is removed from the list
+*/
+template <typename captype, typename tcaptype, typename flowtype>
+ inline typename Graph<captype,tcaptype,flowtype>::node* Graph<captype,tcaptype,flowtype>::next_active()
+{
+ node *i;
+
+ while ( 1 )
+ {
+ if (!(i=queue_first[0]))
+ {
+ queue_first[0] = i = queue_first[1];
+ queue_last[0] = queue_last[1];
+ queue_first[1] = NULL;
+ queue_last[1] = NULL;
+ if (!i) return NULL;
+ }
+
+ /* remove it from the active list */
+ if (i->next == i) queue_first[0] = queue_last[0] = NULL;
+ else queue_first[0] = i -> next;
+ i -> next = NULL;
+
+ /* a node in the list is active iff it has a parent */
+ if (i->parent) return i;
+ }
+}
+
+/***********************************************************************/
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::set_orphan_front(node *i)
+{
+ nodeptr *np;
+ i -> parent = ORPHAN;
+ np = nodeptr_block -> New();
+ np -> ptr = i;
+ np -> next = orphan_first;
+ orphan_first = np;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::set_orphan_rear(node *i)
+{
+ nodeptr *np;
+ i -> parent = ORPHAN;
+ np = nodeptr_block -> New();
+ np -> ptr = i;
+ if (orphan_last) orphan_last -> next = np;
+ else orphan_first = np;
+ orphan_last = np;
+ np -> next = NULL;
+}
+
+/***********************************************************************/
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::add_to_changed_list(node *i)
+{
+ if (changed_list && !i->is_in_changed_list)
+ {
+ node_id* ptr = changed_list->New();
+ *ptr = (node_id)(i - nodes);
+ i->is_in_changed_list = true;
+ }
+}
+
+/***********************************************************************/
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::maxflow_init()
+{
+ node *i;
+
+ queue_first[0] = queue_last[0] = NULL;
+ queue_first[1] = queue_last[1] = NULL;
+ orphan_first = NULL;
+
+ TIME = 0;
+
+ for (i=nodes; i<node_last; i++)
+ {
+ i -> next = NULL;
+ i -> is_marked = 0;
+ i -> is_in_changed_list = 0;
+ i -> TS = TIME;
+ if (i->tr_cap > 0)
+ {
+ /* i is connected to the source */
+ i -> is_sink = 0;
+ i -> parent = TERMINAL;
+ set_active(i);
+ i -> DIST = 1;
+ }
+ else if (i->tr_cap < 0)
+ {
+ /* i is connected to the sink */
+ i -> is_sink = 1;
+ i -> parent = TERMINAL;
+ set_active(i);
+ i -> DIST = 1;
+ }
+ else
+ {
+ i -> parent = NULL;
+ }
+ }
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::maxflow_reuse_trees_init()
+{
+ node* i;
+ node* j;
+ node* queue = queue_first[1];
+ arc* a;
+ nodeptr* np;
+
+ queue_first[0] = queue_last[0] = NULL;
+ queue_first[1] = queue_last[1] = NULL;
+ orphan_first = orphan_last = NULL;
+
+ TIME ++;
+
+ while ((i=queue))
+ {
+ queue = i->next;
+ if (queue == i) queue = NULL;
+ i->next = NULL;
+ i->is_marked = 0;
+ set_active(i);
+
+ if (i->tr_cap == 0)
+ {
+ if (i->parent) set_orphan_rear(i);
+ continue;
+ }
+
+ if (i->tr_cap > 0)
+ {
+ if (!i->parent || i->is_sink)
+ {
+ i->is_sink = 0;
+ for (a=i->first; a; a=a->next)
+ {
+ j = a->head;
+ if (!j->is_marked)
+ {
+ if (j->parent == a->sister) set_orphan_rear(j);
+ if (j->parent && j->is_sink && a->r_cap > 0) set_active(j);
+ }
+ }
+ add_to_changed_list(i);
+ }
+ }
+ else
+ {
+ if (!i->parent || !i->is_sink)
+ {
+ i->is_sink = 1;
+ for (a=i->first; a; a=a->next)
+ {
+ j = a->head;
+ if (!j->is_marked)
+ {
+ if (j->parent == a->sister) set_orphan_rear(j);
+ if (j->parent && !j->is_sink && a->sister->r_cap > 0) set_active(j);
+ }
+ }
+ add_to_changed_list(i);
+ }
+ }
+ i->parent = TERMINAL;
+ i -> TS = TIME;
+ i -> DIST = 1;
+ }
+
+ //test_consistency();
+
+ /* adoption */
+ while ((np=orphan_first))
+ {
+ orphan_first = np -> next;
+ i = np -> ptr;
+ nodeptr_block -> Delete(np);
+ if (!orphan_first) orphan_last = NULL;
+ if (i->is_sink) process_sink_orphan(i);
+ else process_source_orphan(i);
+ }
+ /* adoption end */
+
+ //test_consistency();
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::augment(arc *middle_arc)
+{
+ node *i;
+ arc *a;
+ tcaptype bottleneck;
+
+
+ /* 1. Finding bottleneck capacity */
+ /* 1a - the source tree */
+ bottleneck = middle_arc -> r_cap;
+ for (i=middle_arc->sister->head; ; i=a->head)
+ {
+ a = i -> parent;
+ if (a == TERMINAL) break;
+ if (bottleneck > a->sister->r_cap) bottleneck = a -> sister -> r_cap;
+ }
+ if (bottleneck > i->tr_cap) bottleneck = i -> tr_cap;
+ /* 1b - the sink tree */
+ for (i=middle_arc->head; ; i=a->head)
+ {
+ a = i -> parent;
+ if (a == TERMINAL) break;
+ if (bottleneck > a->r_cap) bottleneck = a -> r_cap;
+ }
+ if (bottleneck > - i->tr_cap) bottleneck = - i -> tr_cap;
+
+
+ /* 2. Augmenting */
+ /* 2a - the source tree */
+ middle_arc -> sister -> r_cap += bottleneck;
+ middle_arc -> r_cap -= bottleneck;
+ for (i=middle_arc->sister->head; ; i=a->head)
+ {
+ a = i -> parent;
+ if (a == TERMINAL) break;
+ a -> r_cap += bottleneck;
+ a -> sister -> r_cap -= bottleneck;
+ if (!a->sister->r_cap)
+ {
+ set_orphan_front(i); // add i to the beginning of the adoption list
+ }
+ }
+ i -> tr_cap -= bottleneck;
+ if (!i->tr_cap)
+ {
+ set_orphan_front(i); // add i to the beginning of the adoption list
+ }
+ /* 2b - the sink tree */
+ for (i=middle_arc->head; ; i=a->head)
+ {
+ a = i -> parent;
+ if (a == TERMINAL) break;
+ a -> sister -> r_cap += bottleneck;
+ a -> r_cap -= bottleneck;
+ if (!a->r_cap)
+ {
+ set_orphan_front(i); // add i to the beginning of the adoption list
+ }
+ }
+ i -> tr_cap += bottleneck;
+ if (!i->tr_cap)
+ {
+ set_orphan_front(i); // add i to the beginning of the adoption list
+ }
+
+
+ flow += bottleneck;
+}
+
+/***********************************************************************/
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::process_source_orphan(node *i)
+{
+ node *j;
+ arc *a0, *a0_min = NULL, *a;
+ int d, d_min = INFINITE_D;
+
+ /* trying to find a new parent */
+ for (a0=i->first; a0; a0=a0->next)
+ if (a0->sister->r_cap)
+ {
+ j = a0 -> head;
+ if (!j->is_sink && (a=j->parent))
+ {
+ /* checking the origin of j */
+ d = 0;
+ while ( 1 )
+ {
+ if (j->TS == TIME)
+ {
+ d += j -> DIST;
+ break;
+ }
+ a = j -> parent;
+ d ++;
+ if (a==TERMINAL)
+ {
+ j -> TS = TIME;
+ j -> DIST = 1;
+ break;
+ }
+ if (a==ORPHAN) { d = INFINITE_D; break; }
+ j = a -> head;
+ }
+ if (d<INFINITE_D) /* j originates from the source - done */
+ {
+ if (d<d_min)
+ {
+ a0_min = a0;
+ d_min = d;
+ }
+ /* set marks along the path */
+ for (j=a0->head; j->TS!=TIME; j=j->parent->head)
+ {
+ j -> TS = TIME;
+ j -> DIST = d --;
+ }
+ }
+ }
+ }
+
+ // GW: the original code gave a warning here, because the
+ // assignment was without parentheis
+ if ((i->parent = a0_min))
+ {
+ i -> TS = TIME;
+ i -> DIST = d_min + 1;
+ }
+ else
+ {
+ /* no parent is found */
+ add_to_changed_list(i);
+
+ /* process neighbors */
+ for (a0=i->first; a0; a0=a0->next)
+ {
+ j = a0 -> head;
+ if (!j->is_sink && (a=j->parent))
+ {
+ if (a0->sister->r_cap) set_active(j);
+ if (a!=TERMINAL && a!=ORPHAN && a->head==i)
+ {
+ set_orphan_rear(j); // add j to the end of the adoption list
+ }
+ }
+ }
+ }
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::process_sink_orphan(node *i)
+{
+ node *j;
+ arc *a0, *a0_min = NULL, *a;
+ int d, d_min = INFINITE_D;
+
+ /* trying to find a new parent */
+ for (a0=i->first; a0; a0=a0->next)
+ if (a0->r_cap)
+ {
+ j = a0 -> head;
+ if (j->is_sink && (a=j->parent))
+ {
+ /* checking the origin of j */
+ d = 0;
+ while ( 1 )
+ {
+ if (j->TS == TIME)
+ {
+ d += j -> DIST;
+ break;
+ }
+ a = j -> parent;
+ d ++;
+ if (a==TERMINAL)
+ {
+ j -> TS = TIME;
+ j -> DIST = 1;
+ break;
+ }
+ if (a==ORPHAN) { d = INFINITE_D; break; }
+ j = a -> head;
+ }
+ if (d<INFINITE_D) /* j originates from the sink - done */
+ {
+ if (d<d_min)
+ {
+ a0_min = a0;
+ d_min = d;
+ }
+ /* set marks along the path */
+ for (j=a0->head; j->TS!=TIME; j=j->parent->head)
+ {
+ j -> TS = TIME;
+ j -> DIST = d --;
+ }
+ }
+ }
+ }
+
+ // GW: the original code gave a warning here, because the
+ // assignment was without parentheis
+
+
+ if ((i->parent = a0_min))
+ {
+ i -> TS = TIME;
+ i -> DIST = d_min + 1;
+ }
+ else
+ {
+ /* no parent is found */
+ add_to_changed_list(i);
+
+ /* process neighbors */
+ for (a0=i->first; a0; a0=a0->next)
+ {
+ j = a0 -> head;
+ if (j->is_sink && (a=j->parent))
+ {
+ if (a0->r_cap) set_active(j);
+ if (a!=TERMINAL && a!=ORPHAN && a->head==i)
+ {
+ set_orphan_rear(j); // add j to the end of the adoption list
+ }
+ }
+ }
+ }
+}
+
+/***********************************************************************/
+
+template <typename captype, typename tcaptype, typename flowtype>
+ flowtype Graph<captype,tcaptype,flowtype>::maxflow(bool reuse_trees, Block<node_id>* _changed_list)
+{
+ node *i, *j, *current_node = NULL;
+ arc *a;
+ nodeptr *np, *np_next;
+
+ if (!nodeptr_block)
+ {
+ nodeptr_block = new DBlock<nodeptr>(NODEPTR_BLOCK_SIZE, error_function);
+ }
+
+ changed_list = _changed_list;
+ if (maxflow_iteration == 0 && reuse_trees) { if (error_function) (*error_function)("reuse_trees cannot be used in the first call to maxflow()!"); exit(1); }
+ if (changed_list && !reuse_trees) { if (error_function) (*error_function)("changed_list cannot be used without reuse_trees!"); exit(1); }
+
+ if (reuse_trees) maxflow_reuse_trees_init();
+ else maxflow_init();
+
+ // main loop
+ while ( 1 )
+ {
+ // test_consistency(current_node);
+
+ if ((i=current_node))
+ {
+ i -> next = NULL; /* remove active flag */
+ if (!i->parent) i = NULL;
+ }
+ if (!i)
+ {
+ if (!(i = next_active())) break;
+ }
+
+ /* growth */
+ if (!i->is_sink)
+ {
+ /* grow source tree */
+ for (a=i->first; a; a=a->next)
+ if (a->r_cap)
+ {
+ j = a -> head;
+ if (!j->parent)
+ {
+ j -> is_sink = 0;
+ j -> parent = a -> sister;
+ j -> TS = i -> TS;
+ j -> DIST = i -> DIST + 1;
+ set_active(j);
+ add_to_changed_list(j);
+ }
+ else if (j->is_sink) break;
+ else if (j->TS <= i->TS &&
+ j->DIST > i->DIST)
+ {
+ /* heuristic - trying to make the distance from j to the source shorter */
+ j -> parent = a -> sister;
+ j -> TS = i -> TS;
+ j -> DIST = i -> DIST + 1;
+ }
+ }
+ }
+ else
+ {
+ /* grow sink tree */
+ for (a=i->first; a; a=a->next)
+ if (a->sister->r_cap)
+ {
+ j = a -> head;
+ if (!j->parent)
+ {
+ j -> is_sink = 1;
+ j -> parent = a -> sister;
+ j -> TS = i -> TS;
+ j -> DIST = i -> DIST + 1;
+ set_active(j);
+ add_to_changed_list(j);
+ }
+ else if (!j->is_sink) { a = a -> sister; break; }
+ else if (j->TS <= i->TS &&
+ j->DIST > i->DIST)
+ {
+ /* heuristic - trying to make the distance from j to the sink shorter */
+ j -> parent = a -> sister;
+ j -> TS = i -> TS;
+ j -> DIST = i -> DIST + 1;
+ }
+ }
+ }
+
+ TIME ++;
+
+ if (a)
+ {
+ i -> next = i; /* set active flag */
+ current_node = i;
+
+ /* augmentation */
+ augment(a);
+ /* augmentation end */
+
+ /* adoption */
+ while ((np=orphan_first))
+ {
+ np_next = np -> next;
+ np -> next = NULL;
+
+ while ((np=orphan_first))
+ {
+ orphan_first = np -> next;
+ i = np -> ptr;
+ nodeptr_block -> Delete(np);
+ if (!orphan_first) orphan_last = NULL;
+ if (i->is_sink) process_sink_orphan(i);
+ else process_source_orphan(i);
+ }
+
+ orphan_first = np_next;
+ }
+ /* adoption end */
+ }
+ else current_node = NULL;
+ }
+ // test_consistency();
+
+ if (!reuse_trees || (maxflow_iteration % 64) == 0)
+ {
+ delete nodeptr_block;
+ nodeptr_block = NULL;
+ }
+
+ maxflow_iteration ++;
+ return flow;
+}
+
+/***********************************************************************/
+
+
+template <typename captype, typename tcaptype, typename flowtype>
+ void Graph<captype,tcaptype,flowtype>::test_consistency(node* current_node)
+{
+ node *i;
+ arc *a;
+ int r;
+ int num1 = 0, num2 = 0;
+
+ // test whether all nodes i with i->next!=NULL are indeed in the queue
+ for (i=nodes; i<node_last; i++)
+ {
+ if (i->next || i==current_node) num1 ++;
+ }
+ for (r=0; r<3; r++)
+ {
+ i = (r == 2) ? current_node : queue_first[r];
+ if (i)
+ for ( ; ; i=i->next)
+ {
+ num2 ++;
+ if (i->next == i)
+ {
+ if (r<2) assert(i == queue_last[r]);
+ else assert(i == current_node);
+ break;
+ }
+ }
+ }
+ assert(num1 == num2);
+
+ for (i=nodes; i<node_last; i++)
+ {
+ // test whether all edges in seach trees are non-saturated
+ if (i->parent == NULL) {}
+ else if (i->parent == ORPHAN) {}
+ else if (i->parent == TERMINAL)
+ {
+ if (!i->is_sink) assert(i->tr_cap > 0);
+ else assert(i->tr_cap < 0);
+ }
+ else
+ {
+ if (!i->is_sink) assert (i->parent->sister->r_cap > 0);
+ else assert (i->parent->r_cap > 0);
+ }
+ // test whether passive nodes in search trees have neighbors in
+ // a different tree through non-saturated edges
+ if (i->parent && !i->next)
+ {
+ if (!i->is_sink)
+ {
+ assert(i->tr_cap >= 0);
+ for (a=i->first; a; a=a->next)
+ {
+ if (a->r_cap > 0) assert(a->head->parent && !a->head->is_sink);
+ }
+ }
+ else
+ {
+ assert(i->tr_cap <= 0);
+ for (a=i->first; a; a=a->next)
+ {
+ if (a->sister->r_cap > 0) assert(a->head->parent && a->head->is_sink);
+ }
+ }
+ }
+ // test marking invariants
+ if (i->parent && i->parent!=ORPHAN && i->parent!=TERMINAL)
+ {
+ assert(i->TS <= i->parent->head->TS);
+ if (i->TS == i->parent->head->TS) assert(i->DIST > i->parent->head->DIST);
+ }
+ }
+}
+
+} // end namespace maxflow
diff --git a/maxflow/graph.h b/maxflow/graph.h
new file mode 100644
index 0000000..e723871
--- /dev/null
+++ b/maxflow/graph.h
@@ -0,0 +1,511 @@
+/* graph.h */
+/*
+ Copyright 2006-2015
+ Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca)
+
+ This file is part of MAXFLOW.
+
+ MAXFLOW is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ MAXFLOW is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+
+========================
+
+ version 3.03
+
+ This software library implements the maxflow algorithm
+ described in
+
+ "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision."
+ Yuri Boykov and Vladimir Kolmogorov.
+ In IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI),
+ September 2004
+
+ This algorithm was developed by Yuri Boykov and Vladimir Kolmogorov
+ at Siemens Corporate Research. To make it available for public use,
+ it was later reimplemented by Vladimir Kolmogorov based on open publications.
+
+ If you use this software for research purposes, you should cite
+ the aforementioned paper in any resulting publication.
+
+ ----------------------------------------------------------------------
+
+ REUSING TREES:
+
+ Starting with version 3.0, there is a also an option of reusing search
+ trees from one maxflow computation to the next, as described in
+
+ "Efficiently Solving Dynamic Markov Random Fields Using Graph Cuts."
+ Pushmeet Kohli and Philip H.S. Torr
+ International Conference on Computer Vision (ICCV), 2005
+
+ If you use this option, you should cite
+ the aforementioned paper in any resulting publication.
+*/
+
+
+
+/*
+ For description, license, example usage see README.TXT.
+*/
+
+#ifndef __GRAPH_H__
+#define __GRAPH_H__
+
+#include <string.h>
+#include "block.h"
+
+#include <assert.h>
+// NOTE: in UNIX you need to use -DNDEBUG preprocessor option to supress assert's!!!
+
+
+namespace maxflow {
+
+// captype: type of edge capacities (excluding t-links)
+// tcaptype: type of t-links (edges between nodes and terminals)
+// flowtype: type of total flow
+//
+// Current instantiations are in instances.inc
+template <typename captype, typename tcaptype, typename flowtype> class Graph
+{
+public:
+ typedef enum
+ {
+ SOURCE = 0,
+ SINK = 1
+ } termtype; // terminals
+ typedef int node_id;
+
+ /////////////////////////////////////////////////////////////////////////
+ // BASIC INTERFACE FUNCTIONS //
+ // (should be enough for most applications) //
+ /////////////////////////////////////////////////////////////////////////
+
+ // Constructor.
+ // The first argument gives an estimate of the maximum number of nodes that can be added
+ // to the graph, and the second argument is an estimate of the maximum number of edges.
+ // The last (optional) argument is the pointer to the function which will be called
+ // if an error occurs; an error message is passed to this function.
+ // If this argument is omitted, exit(1) will be called.
+ //
+ // IMPORTANT: It is possible to add more nodes to the graph than node_num_max
+ // (and node_num_max can be zero). However, if the count is exceeded, then
+ // the internal memory is reallocated (increased by 50%) which is expensive.
+ // Also, temporarily the amount of allocated memory would be more than twice than needed.
+ // Similarly for edges.
+ // If you wish to avoid this overhead, you can download version 2.2, where nodes and edges are stored in blocks.
+ Graph(int node_num_max, int edge_num_max, void (*err_function)(const char *) = NULL);
+
+ // Destructor
+ ~Graph();
+
+ // Adds node(s) to the graph. By default, one node is added (num=1); then first call returns 0, second call returns 1, and so on.
+ // If num>1, then several nodes are added, and node_id of the first one is returned.
+ // IMPORTANT: see note about the constructor
+ node_id add_node(int num = 1);
+
+ // Adds a bidirectional edge between 'i' and 'j' with the weights 'cap' and 'rev_cap'.
+ // IMPORTANT: see note about the constructor
+ void add_edge(node_id i, node_id j, captype cap, captype rev_cap);
+
+ // Adds new edges 'SOURCE->i' and 'i->SINK' with corresponding weights.
+ // Can be called multiple times for each node.
+ // Weights can be negative.
+ // NOTE: the number of such edges is not counted in edge_num_max.
+ // No internal memory is allocated by this call.
+ void add_tweights(node_id i, tcaptype cap_source, tcaptype cap_sink);
+
+
+ // Computes the maxflow. Can be called several times.
+ // FOR DESCRIPTION OF reuse_trees, SEE mark_node().
+ // FOR DESCRIPTION OF changed_list, SEE remove_from_changed_list().
+ flowtype maxflow(bool reuse_trees = false, Block<node_id>* changed_list = NULL);
+
+ // After the maxflow is computed, this function returns to which
+ // segment the node 'i' belongs (Graph<captype,tcaptype,flowtype>::SOURCE or Graph<captype,tcaptype,flowtype>::SINK).
+ //
+ // Occasionally there may be several minimum cuts. If a node can be assigned
+ // to both the source and the sink, then default_segm is returned.
+ termtype what_segment(node_id i, termtype default_segm = SOURCE) const;
+
+
+
+ //////////////////////////////////////////////
+ // ADVANCED INTERFACE FUNCTIONS //
+ // (provide access to the graph) //
+ //////////////////////////////////////////////
+
+private:
+ struct node;
+ struct arc;
+
+public:
+
+ ////////////////////////////
+ // 1. Reallocating graph. //
+ ////////////////////////////
+
+ // Removes all nodes and edges.
+ // After that functions add_node() and add_edge() must be called again.
+ //
+ // Advantage compared to deleting Graph and allocating it again:
+ // no calls to delete/new (which could be quite slow).
+ //
+ // If the graph structure stays the same, then an alternative
+ // is to go through all nodes/edges and set new residual capacities
+ // (see functions below).
+ void reset();
+
+ ////////////////////////////////////////////////////////////////////////////////
+ // 2. Functions for getting pointers to arcs and for reading graph structure. //
+ // NOTE: adding new arcs may invalidate these pointers (if reallocation //
+ // happens). So it's best not to add arcs while reading graph structure. //
+ ////////////////////////////////////////////////////////////////////////////////
+
+ // The following two functions return arcs in the same order that they
+ // were added to the graph. NOTE: for each call add_edge(i,j,cap,cap_rev)
+ // the first arc returned will be i->j, and the second j->i.
+ // If there are no more arcs, then the function can still be called, but
+ // the returned arc_id is undetermined.
+ typedef arc* arc_id;
+ arc_id get_first_arc();
+ arc_id get_next_arc(arc_id a);
+
+ // other functions for reading graph structure
+ int get_node_num() { return node_num; }
+ int get_arc_num() { return (int)(arc_last - arcs); }
+ void get_arc_ends(arc_id a, node_id& i, node_id& j); // returns i,j to that a = i->j
+
+ ///////////////////////////////////////////////////
+ // 3. Functions for reading residual capacities. //
+ ///////////////////////////////////////////////////
+
+ // returns residual capacity of SOURCE->i minus residual capacity of i->SINK
+ tcaptype get_trcap(node_id i);
+ // returns residual capacity of arc a
+ captype get_rcap(arc* a);
+
+ /////////////////////////////////////////////////////////////////
+ // 4. Functions for setting residual capacities. //
+ // NOTE: If these functions are used, the value of the flow //
+ // returned by maxflow() will not be valid! //
+ /////////////////////////////////////////////////////////////////
+
+ void set_trcap(node_id i, tcaptype trcap);
+ void set_rcap(arc* a, captype rcap);
+
+ ////////////////////////////////////////////////////////////////////
+ // 5. Functions related to reusing trees & list of changed nodes. //
+ ////////////////////////////////////////////////////////////////////
+
+ // If flag reuse_trees is true while calling maxflow(), then search trees
+ // are reused from previous maxflow computation.
+ // In this case before calling maxflow() the user must
+ // specify which parts of the graph have changed by calling mark_node():
+ // add_tweights(i),set_trcap(i) => call mark_node(i)
+ // add_edge(i,j),set_rcap(a) => call mark_node(i); mark_node(j)
+ //
+ // This option makes sense only if a small part of the graph is changed.
+ // The initialization procedure goes only through marked nodes then.
+ //
+ // mark_node(i) can either be called before or after graph modification.
+ // Can be called more than once per node, but calls after the first one
+ // do not have any effect.
+ //
+ // NOTE:
+ // - This option cannot be used in the first call to maxflow().
+ // - It is not necessary to call mark_node() if the change is ``not essential'',
+ // i.e. sign(trcap) is preserved for a node and zero/nonzero status is preserved for an arc.
+ // - To check that you marked all necessary nodes, you can call maxflow(false) after calling maxflow(true).
+ // If everything is correct, the two calls must return the same value of flow. (Useful for debugging).
+ void mark_node(node_id i);
+
+ // If changed_list is not NULL while calling maxflow(), then the algorithm
+ // keeps a list of nodes which could potentially have changed their segmentation label.
+ // Nodes which are not in the list are guaranteed to keep their old segmentation label (SOURCE or SINK).
+ // Example usage:
+ //
+ // typedef Graph<int,int,int> G;
+ // G* g = new Graph(nodeNum, edgeNum);
+ // Block<G::node_id>* changed_list = new Block<G::node_id>(128);
+ //
+ // ... // add nodes and edges
+ //
+ // g->maxflow(); // first call should be without arguments
+ // for (int iter=0; iter<10; iter++)
+ // {
+ // ... // change graph, call mark_node() accordingly
+ //
+ // g->maxflow(true, changed_list);
+ // G::node_id* ptr;
+ // for (ptr=changed_list->ScanFirst(); ptr; ptr=changed_list->ScanNext())
+ // {
+ // G::node_id i = *ptr; assert(i>=0 && i<nodeNum);
+ // g->remove_from_changed_list(i);
+ // // do something with node i...
+ // if (g->what_segment(i) == G::SOURCE) { ... }
+ // }
+ // changed_list->Reset();
+ // }
+ // delete changed_list;
+ //
+ // NOTE:
+ // - If changed_list option is used, then reuse_trees must be used as well.
+ // - In the example above, the user may omit calls g->remove_from_changed_list(i) and changed_list->Reset() in a given iteration.
+ // Then during the next call to maxflow(true, &changed_list) new nodes will be added to changed_list.
+ // - If the next call to maxflow() does not use option reuse_trees, then calling remove_from_changed_list()
+ // is not necessary. ("changed_list->Reset()" or "delete changed_list" should still be called, though).
+ void remove_from_changed_list(node_id i)
+ {
+ assert(i>=0 && i<node_num && nodes[i].is_in_changed_list);
+ nodes[i].is_in_changed_list = 0;
+ }
+
+
+
+
+
+
+/////////////////////////////////////////////////////////////////////////
+/////////////////////////////////////////////////////////////////////////
+/////////////////////////////////////////////////////////////////////////
+
+private:
+ // internal variables and functions
+
+ struct node
+ {
+ arc *first; // first outcoming arc
+
+ arc *parent; // node's parent
+ node *next; // pointer to the next active node
+ // (or to itself if it is the last node in the list)
+ int TS; // timestamp showing when DIST was computed
+ int DIST; // distance to the terminal
+ int is_sink : 1; // flag showing whether the node is in the source or in the sink tree (if parent!=NULL)
+ int is_marked : 1; // set by mark_node()
+ int is_in_changed_list : 1; // set by maxflow if
+
+ tcaptype tr_cap; // if tr_cap > 0 then tr_cap is residual capacity of the arc SOURCE->node
+ // otherwise -tr_cap is residual capacity of the arc node->SINK
+
+ };
+
+ struct arc
+ {
+ node *head; // node the arc points to
+ arc *next; // next arc with the same originating node
+ arc *sister; // reverse arc
+
+ captype r_cap; // residual capacity
+ };
+
+ struct nodeptr
+ {
+ node *ptr;
+ nodeptr *next;
+ };
+ static const int NODEPTR_BLOCK_SIZE = 128;
+
+ node *nodes, *node_last, *node_max; // node_last = nodes+node_num, node_max = nodes+node_num_max;
+ arc *arcs, *arc_last, *arc_max; // arc_last = arcs+2*edge_num, arc_max = arcs+2*edge_num_max;
+
+ int node_num;
+
+ DBlock<nodeptr> *nodeptr_block;
+
+ void (*error_function)(const char *); // this function is called if a error occurs,
+ // with a corresponding error message
+ // (or exit(1) is called if it's NULL)
+
+ flowtype flow; // total flow
+
+ // reusing trees & list of changed pixels
+ int maxflow_iteration; // counter
+ Block<node_id> *changed_list;
+
+ /////////////////////////////////////////////////////////////////////////
+
+ node *queue_first[2], *queue_last[2]; // list of active nodes
+ nodeptr *orphan_first, *orphan_last; // list of pointers to orphans
+ int TIME; // monotonically increasing global counter
+
+ /////////////////////////////////////////////////////////////////////////
+
+ void reallocate_nodes(int num); // num is the number of new nodes
+ void reallocate_arcs();
+
+ // functions for processing active list
+ void set_active(node *i);
+ node *next_active();
+
+ // functions for processing orphans list
+ void set_orphan_front(node* i); // add to the beginning of the list
+ void set_orphan_rear(node* i); // add to the end of the list
+
+ void add_to_changed_list(node* i);
+
+ void maxflow_init(); // called if reuse_trees == false
+ void maxflow_reuse_trees_init(); // called if reuse_trees == true
+ void augment(arc *middle_arc);
+ void process_source_orphan(node *i);
+ void process_sink_orphan(node *i);
+
+ void test_consistency(node* current_node=NULL); // debug function
+};
+
+
+
+///////////////////////////////////////
+// Implementation - inline functions //
+///////////////////////////////////////
+
+
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline typename Graph<captype,tcaptype,flowtype>::node_id Graph<captype,tcaptype,flowtype>::add_node(int num)
+{
+ assert(num > 0);
+
+ if (node_last + num > node_max) reallocate_nodes(num);
+
+ memset(node_last, 0, num*sizeof(node));
+
+ node_id i = node_num;
+ node_num += num;
+ node_last += num;
+ return i;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::add_tweights(node_id i, tcaptype cap_source, tcaptype cap_sink)
+{
+ assert(i >= 0 && i < node_num);
+
+ tcaptype delta = nodes[i].tr_cap;
+ if (delta > 0) cap_source += delta;
+ else cap_sink -= delta;
+ flow += (cap_source < cap_sink) ? cap_source : cap_sink;
+ nodes[i].tr_cap = cap_source - cap_sink;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::add_edge(node_id _i, node_id _j, captype cap, captype rev_cap)
+{
+ assert(_i >= 0 && _i < node_num);
+ assert(_j >= 0 && _j < node_num);
+ assert(_i != _j);
+ assert(cap >= 0);
+ assert(rev_cap >= 0);
+
+ if (arc_last == arc_max) reallocate_arcs();
+
+ arc *a = arc_last ++;
+ arc *a_rev = arc_last ++;
+
+ node* i = nodes + _i;
+ node* j = nodes + _j;
+
+ a -> sister = a_rev;
+ a_rev -> sister = a;
+ a -> next = i -> first;
+ i -> first = a;
+ a_rev -> next = j -> first;
+ j -> first = a_rev;
+ a -> head = j;
+ a_rev -> head = i;
+ a -> r_cap = cap;
+ a_rev -> r_cap = rev_cap;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline typename Graph<captype,tcaptype,flowtype>::arc* Graph<captype,tcaptype,flowtype>::get_first_arc()
+{
+ return arcs;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline typename Graph<captype,tcaptype,flowtype>::arc* Graph<captype,tcaptype,flowtype>::get_next_arc(arc* a)
+{
+ return a + 1;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::get_arc_ends(arc* a, node_id& i, node_id& j)
+{
+ assert(a >= arcs && a < arc_last);
+ i = (node_id) (a->sister->head - nodes);
+ j = (node_id) (a->head - nodes);
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline tcaptype Graph<captype,tcaptype,flowtype>::get_trcap(node_id i)
+{
+ assert(i>=0 && i<node_num);
+ return nodes[i].tr_cap;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline captype Graph<captype,tcaptype,flowtype>::get_rcap(arc* a)
+{
+ assert(a >= arcs && a < arc_last);
+ return a->r_cap;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::set_trcap(node_id i, tcaptype trcap)
+{
+ assert(i>=0 && i<node_num);
+ nodes[i].tr_cap = trcap;
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::set_rcap(arc* a, captype rcap)
+{
+ assert(a >= arcs && a < arc_last);
+ a->r_cap = rcap;
+}
+
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline typename Graph<captype,tcaptype,flowtype>::termtype Graph<captype,tcaptype,flowtype>::what_segment(node_id i, termtype default_segm) const
+{
+ if (nodes[i].parent)
+ {
+ return (nodes[i].is_sink) ? SINK : SOURCE;
+ }
+ else
+ {
+ return default_segm;
+ }
+}
+
+template <typename captype, typename tcaptype, typename flowtype>
+ inline void Graph<captype,tcaptype,flowtype>::mark_node(node_id _i)
+{
+ node* i = nodes + _i;
+ if (!i->next)
+ {
+ /* it's not in the list yet */
+ if (queue_last[1]) queue_last[1] -> next = i;
+ else queue_first[1] = i;
+ queue_last[1] = i;
+ i -> next = i;
+ }
+ i->is_marked = 1;
+}
+
+
+
+} // end namespace
+
+#endif
diff --git a/test_maxflow.cpp b/test_maxflow.cpp
new file mode 100644
index 0000000..8cacc2f
--- /dev/null
+++ b/test_maxflow.cpp
@@ -0,0 +1,211 @@
+/*
+
+ Copyright 2006-2015,
+ Vladimir Kolmogorov (vnk at ist.ac.at), Yuri Boykov (yuri at csd.uwo.ca)
+
+ This file is part of MAXFLOW.
+
+ MAXFLOW is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ MAXFLOW is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with MAXFLOW. If not, see <http://www.gnu.org/licenses/>.
+
+*/
+
+
+// Implement some simple tests for maxflow
+
+#include <iostream>
+#include <maxflow.h>
+
+using std::cerr;
+using std::pair;
+using std::make_pair;
+using maxflow::Graph_III;
+
+int test_node(const Graph_III& g, int id, Graph_III::termtype segment, const char *testid)
+{
+ if (g.what_segment(id) != segment) {
+ cerr << testid << "Node " << id << "not es expected in "
+ << (segment == Graph_III::SOURCE ? "Source" : "Sink")
+ << " set\n";
+ return 1;
+ }
+ return 0;
+}
+
+/*
+ Test the following graph:
+
+ SOURCE
+ / \
+ 5/ \2
+ / 3 \
+ node0 -----> node1
+ | <----- |
+ | 4 |
+ \ /
+ 1\ /6
+ \ /
+ SINK
+
+ flow = 6
+ node 0 = source
+ node 1 = sink
+*/
+
+
+
+pair<int,int> test_1()
+{
+ Graph_III g(2,1);
+
+ g.add_node();
+ g.add_node();
+
+ g.add_tweights( 0, /* capacities */ 5, 1 );
+ g.add_tweights( 1, /* capacities */ 2, 6 );
+ g.add_edge( 0, 1, /* capacities */ 3, 4 );
+
+ int flow = g.maxflow();
+
+ pair<int,int> result = make_pair(0, 3);
+ if (flow != 6) {
+ cerr << "test_1: Flow = " << flow << ", " << "expected 6\n";
+ ++result.first;
+ }
+
+ result.first += test_node(g, 0, Graph_III::SOURCE, "test_1");
+ result.first += test_node(g, 1, Graph_III::SINK, "test_1");
+ return result;
+}
+
+
+/*
+ Test the following graph:
+
+ SOURCE
+ / \
+ 1/ \2
+ / 3 \
+ node0 -----> node1
+ | <----- |
+ | 4 |
+ \ /
+ 5\ /6
+ \ /
+ SINK
+
+ flow = 3
+ node 0 = sink
+ node 1 = sink
+*/
+
+
+
+pair<int,int> test_2()
+{
+ Graph_III g(2,1);
+
+ g.add_node();
+ g.add_node();
+
+ g.add_tweights( 0, /* capacities */ 1, 5 );
+ g.add_tweights( 1, /* capacities */ 2, 6 );
+ g.add_edge( 0, 1, /* capacities */ 3, 4 );
+
+ int flow = g.maxflow();
+
+ pair<int,int> result = make_pair(0, 3);
+ if (flow != 3) {
+ cerr << "test_2: Flow = " << flow << ", " << "expected 3\n";
+ ++result.first;
+ }
+
+ result.first += test_node(g, 0, Graph_III::SINK, "test_2");
+ result.first += test_node(g, 1, Graph_III::SINK, "test_2");
+
+ return result;
+}
+
+
+/*
+ Test the following graph:
+
+ ---- SOURCE------
+ / \
+ 6/ \ 4
+ / 4 3 \
+ node0 -----> node1 ---->node2
+ | <----- <----- /
+ | 2 5 |
+ \ /
+ 3\ /6
+ \ /
+ SINK
+
+ flow = 9
+ node 0 = source
+ node 1 = sink
+ node 2 = sink
+*/
+
+
+
+pair<int,int> test_3()
+{
+ Graph_III g(3,2);
+
+ g.add_node();
+ g.add_node();
+ g.add_node();
+
+ g.add_tweights( 0, /* capacities */ 6, 4 );
+ g.add_tweights( 2, /* capacities */ 3, 6 );
+ g.add_edge( 0, 1, /* capacities */ 2, 4 );
+ g.add_edge( 1, 2, /* capacities */ 3, 5 );
+
+ int flow = g.maxflow();
+
+ pair<int,int> result = make_pair(0,4);
+
+ if (flow != 9) {
+ cerr << "test_2: Flow = " << flow << ", " << "expected 9\n";
+ ++result.first;
+ }
+
+ result.first += test_node(g, 0, Graph_III::SOURCE, "test_3");
+ result.first += test_node(g, 1, Graph_III::SINK, "test_3");
+ result.first += test_node(g, 2, Graph_III::SINK, "test_3");
+
+ return result;
+}
+
+pair<int,int>& operator += (pair<int,int>& lhs, const pair<int,int>& rhs)
+{
+ lhs.first += rhs.first;
+ lhs.second += rhs.second;
+ return lhs;
+}
+
+int main()
+{
+ pair<int,int> failures = make_pair<int, int>(0,0);
+
+ failures += test_1();
+ failures += test_2();
+ failures += test_3();
+
+ cerr << failures.first << " of " << failures.second << " test failed\n";
+
+ return failures.first > 0 ? EXIT_FAILURE : EXIT_SUCCESS;
+}
+
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-med/maxflow.git
More information about the debian-med-commit
mailing list