Browse Source

First commit : switch paradevs project to two different repositories

Eric Ramat 6 years ago
commit
9d56670331
47 changed files with 16680 additions and 0 deletions
  1. 2 0
      .gitignore
  2. 31 0
      AUTHORS
  3. 109 0
      CMakeCPack.cmake
  4. 123 0
      CMakeLists.txt
  5. 676 0
      COPYING
  6. 32 0
      README
  7. BIN
      doc/comparison.ods
  8. 8 0
      src/CMakeLists.txt
  9. 18 0
      src/tests/CMakeLists.txt
  10. 22 0
      src/tests/boost_graph/CMakeLists.txt
  11. 466 0
      src/tests/boost_graph/graph_builder.hpp
  12. 78 0
      src/tests/boost_graph/graph_defs.hpp
  13. 758 0
      src/tests/boost_graph/graph_manager.hpp
  14. 171 0
      src/tests/boost_graph/graph_partitioning.hpp
  15. 207 0
      src/tests/boost_graph/models.hpp
  16. 30 0
      src/tests/boost_graph/partitioning/CMakeLists.txt
  17. 71 0
      src/tests/boost_graph/partitioning/defs.hpp
  18. 939 0
      src/tests/boost_graph/partitioning/gggp.cpp
  19. 68 0
      src/tests/boost_graph/partitioning/gggp.hpp
  20. 434 0
      src/tests/boost_graph/partitioning/graph_build.cpp
  21. 39 0
      src/tests/boost_graph/partitioning/graph_build.hpp
  22. 132 0
      src/tests/boost_graph/partitioning/main.cpp
  23. 1588 0
      src/tests/boost_graph/partitioning/utils.cpp
  24. 114 0
      src/tests/boost_graph/partitioning/utils.hpp
  25. 378 0
      src/tests/boost_graph/tests.cpp
  26. 6446 0
      src/tests/catch.hpp
  27. 12 0
      src/tests/common/CMakeLists.txt
  28. 17 0
      src/tests/common/scheduler/CMakeLists.txt
  29. 167 0
      src/tests/common/scheduler/tests.cpp
  30. 17 0
      src/tests/dtss/CMakeLists.txt
  31. 119 0
      src/tests/dtss/graph_manager.hpp
  32. 195 0
      src/tests/dtss/models.hpp
  33. 120 0
      src/tests/dtss/tests.cpp
  34. 19 0
      src/tests/mixed/CMakeLists.txt
  35. 428 0
      src/tests/mixed/graph_manager.hpp
  36. 622 0
      src/tests/mixed/models.hpp
  37. 124 0
      src/tests/mixed/tests.cpp
  38. 16 0
      src/tests/multithreading/CMakeLists.txt
  39. 406 0
      src/tests/multithreading/graph_manager.hpp
  40. 230 0
      src/tests/multithreading/lifegame/graph_manager.hpp
  41. 95 0
      src/tests/multithreading/lifegame/models.hpp
  42. 88 0
      src/tests/multithreading/lifegame/tests.cpp
  43. 139 0
      src/tests/multithreading/tests.cpp
  44. 16 0
      src/tests/pdevs/CMakeLists.txt
  45. 248 0
      src/tests/pdevs/graph_manager.hpp
  46. 357 0
      src/tests/pdevs/models.hpp
  47. 305 0
      src/tests/pdevs/tests.cpp

+ 2 - 0
.gitignore

@@ -0,0 +1,2 @@
+*~
+build/

+ 31 - 0
AUTHORS

@@ -0,0 +1,31 @@
+                 PARADEVS development team
+                 =========================
+
+
+Copyright
+=========
+
+- ULCO
+  - Copyright © 2013-2014
+  - Université du Littoral Côte d'Opale
+  - http://www.univ-littoral.fr
+
+Authors
+=======
+
+Integrator / Release manager
+----------------------------
+
+- Eric Ramat <eric.ramat@gmail.com>
+
+
+Main programmer and founder
+---------------------------
+
+- Eric Ramat <eric.ramat@gmail.com>
+
+
+Contributors
+------------
+
+- Christopher Herbez <christopher.herbez@gmail.com>

+ 109 - 0
CMakeCPack.cmake

@@ -0,0 +1,109 @@
+INCLUDE(InstallRequiredSystemLibraries)
+
+IF (WIN32)
+  SET(CPACK_GENERATOR "NSIS")
+  SET(CPACK_SOURCE_GENERATOR "ZIP")
+ENDIF (WIN32)
+
+IF (UNIX)
+  SET(CPACK_GENERATOR "TGZ;DEB;RPM")
+  SET(CPACK_SOURCE_GENERATOR "ZIP;TGZ;TBZ2")
+ENDIF (UNIX)
+
+IF (APPLE)
+  SET(CPACK_GENERATOR "OSXX11")
+ENDIF (APPLE)
+
+SET(CPACK_STRIP_FILES "1")
+SET(CPACK_PACKAGE_NAME "VLE")
+SET(CPACK_PACKAGE_VENDOR "VLE Development Team")
+SET(CPACK_PACKAGE_DESCRIPTION_SUMMARY "VLE - Virtual Laboratory Environment")
+SET(CPACK_PACKAGE_CONTACT "Gauthier Quesnel <quesnel@users.sourceforge.net>")
+SET(CPACK_PACKAGE_DESCRIPTION_FILE "${PROJECT_SOURCE_DIR}/README")
+SET(CPACK_RESOURCE_FILE_LICENSE "${PROJECT_SOURCE_DIR}/COPYING")
+SET(CPACK_PACKAGE_FILE_NAME "${VLE_NAME_COMPLETE}-${CMAKE_SYSTEM_NAME}-${CMAKE_SYSTEM_PROCESSOR}")
+SET(CPACK_PACKAGE_VERSION_MAJOR "${VLE_MAJOR}")
+SET(CPACK_PACKAGE_VERSION_MINOR "${VLE_MINOR}")
+
+IF ("${VLE_EXTRA}" STREQUAL "")
+  SET(CPACK_PACKAGE_VERSION_PATCH "${VLE_PATCH}")
+ELSE ("${VLE_EXTRA}" STREQUAL "")
+  SET(CPACK_PACKAGE_VERSION_PATCH "${VLE_PATCH}-${VLE_EXTRA}")
+ENDIF ("${VLE_EXTRA}" STREQUAL "")
+
+SET(CPACK_PACKAGE_INSTALL_DIRECTORY ${VLE_NAME_COMPLETE})
+SET(CPACK_PACKAGE_EXECUTABLES "vle" "VLE" "oov" "OOV" "eov" "EOV" "gvle" "GVLE")
+
+# CPack source configuration
+SET(CPACK_SOURCE_PACKAGE_FILE_NAME ${VLE_NAME_COMPLETE})
+SET(CPACK_SOURCE_IGNORE_FILES "\\\\.swp$;/\\\\.gitignore;/build/;/\\\\.git/")
+
+# CPack DEB configuration
+SET(CPACK_DEBIAN_PACKAGE_NAME ${VLE_NAME}-${VLE_MAJOR}.${VLE_MINOR})
+SET(CPACK_DEBIAN_PACKAGE_VERSION ${VLE_COMPLETE})
+SET(CPACK_DEBIAN_PACKAGE_DEPENDS "")
+SET(CPACK_DEBIAN_PACKAGE_BUILDS_DEPENDS "")
+SET(CPACK_DEBIAN_PACKAGE_MAINTAINER "Gauthier Quesnel <quesnel@users.sourceforge.net>")
+SET(CPACK_DEBIAN_PACKAGE_DESCRIPTION "VLE, a framework for multi-modeling, simulation and analysis of complex dynamical systems.")
+SET(CPACK_DEBIAN_PACKAGE_SECTION "libs")
+SET(CPACK_DEBIAN_PACKAGE_PRIORITY "extra")
+
+# CPack RPM configuration
+SET(CPACK_RPM_PACKAGE_SUMMARY "VLE, a framework for multi-modeling, simulation and analysis of complex dynamical systems.")
+SET(CPACK_RPM_PACKAGE_NAME ${VLE_NAME}-${VLE_MAJOR}.${VLE_MINOR})
+SET(CPACK_RPM_PACKAGE_VERSION ${VLE_MAJOR}.${VLE_MINOR}.${VLE_PATCH})
+SET(CPACK_RPM_PACKAGE_RELEASE "1")
+SET(CPACK_RPM_PACKAGE_VENDOR "Gauthier Quesnel <quesnel@users.sourceforge.net>")
+SET(CPACK_RPM_PACKAGE_LICENSE "GNU General Public License (GPL)")
+SET(CPACK_RPM_PACKAGE_DESCRIPTION "VLE, a framework for multi-modeling, simulation and analysis of complex dynamical systems.")
+
+# CPack NSIS configuration
+IF (CPACK_GENERATOR MATCHES "NSIS")
+  SET(CMAKE_MODULE_PATH "share")
+  SET(VLE_BOOST_INCLUDE_DIR CACHE PATH "Boost include directory")
+  SET(VLE_BOOST_LIBRARY_DIR CACHE PATH "Boost library directory")
+  SET(VLE_MINGW_PATH CACHE PATH "Mingw Boost directory")
+  SET(VLE_GTK_PATH CACHE PATH "Gtk directory")
+  SET(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/share)
+
+  INSTALL(DIRECTORY "${VLE_BOOST_INCLUDE_DIR}/" DESTINATION include)
+  INSTALL(DIRECTORY "${VLE_BOOST_LIBRARY_DIR}/" DESTINATION bin
+    FILES_MATCHING PATTERN "libboost*.dll")
+  INSTALL(DIRECTORY "${VLE_BOOST_LIBRARY_DIR}/" DESTINATION lib
+    FILES_MATCHING PATTERN "libboost*.a")
+
+  INSTALL(FILES "${VLE_MINGW_PATH}/bin\\\\mingwm10.dll" DESTINATION bin)
+
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/include/" DESTINATION include)
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/redist/" DESTINATION bin)
+
+  INSTALL(FILES "${VLE_GTK_PATH}/bin\\\\pkg-config.exe" DESTINATION bin)
+
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/lib/" DESTINATION lib
+    PATTERN "*.def" EXCLUDE
+    PATTERN "*.lib" EXCLUDE)
+
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/etc\\\\gtk-2.0" DESTINATION etc)
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/etc\\\\pango" DESTINATION etc)
+
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/share\\\\doc" DESTINATION share)
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/share\\\\locale" DESTINATION share)
+  INSTALL(DIRECTORY "${VLE_GTK_PATH}/share\\\\themes" DESTINATION share)
+
+  SET(CPACK_NSIS_MUI_ICON "${PROJECT_SOURCE_DIR}/share/pixmaps\\\\vle.ico")
+  SET(CPACK_NSIS_MUI_UNIICON "${PROJECT_SOURCE_DIR}/share/pixmaps\\\\vle.ico")
+  SET(CPACK_PACKAGE_ICON "${PROJECT_SOURCE_DIR}/share/pixmaps\\\\logo.bmp")
+  SET(CPACK_NSIS_MENU_LINKS "${VLE_SHARE_DIRS}/doc/vle.chm" "VLE API" "http://www.sourceforge.net/projects/vle" "VLE Web Site")
+  SET(CPACK_CREATE_DESKTOP_LINKS gvle)
+  SET(CPACK_NSIS_INSTALLED_ICON_NAME "bin\\\\vle.exe")
+  SET(CPACK_NSIS_DISPLAY_NAME "VLE - Virtual Laboratory Environment")
+  SET(CPACK_NSIS_HELP_LINK "http://www.sourceforge.net/projects/vle")
+  SET(CPACK_NSIS_URL_INFO_ABOUT "http://www.sourceforge.net/projects/vle")
+  SET(CPACK_NSIS_CONTACT "Gauthier Quesnel <quesnel@users.sourceforge.net>")
+  SET(CPACK_PACKAGE_INSTALL_REGISTRY_KEY "${CPACK_PACKAGE_NAME} ${VLE_VERSION_SHORT}.0")
+  SET(CPACK_NSIS_MODIFY_PATH ON)
+ENDIF (CPACK_GENERATOR MATCHES "NSIS")
+
+INCLUDE(CPack)
+
+# vim:tw=0:ts=8:tw=0:sw=2:sts=2

+ 123 - 0
CMakeLists.txt

@@ -0,0 +1,123 @@
+CMAKE_MINIMUM_REQUIRED(VERSION 2.6)
+PROJECT(PARADEVS_TEST CXX C)
+ENABLE_TESTING()
+
+SET(MODEL_MAJOR 0)
+SET(MODEL_MINOR 1)
+SET(MODEL_PATCH 0)
+SET(MODEL_EXTRA "-dev")
+
+IF ("${MODEL_EXTRA}" STREQUAL "")
+  SET(MODEL_NAME "${PROJECT_NAME}-${MODEL_MAJOR}.${MODEL_MINOR}.${MODEL_PATCH}")
+ELSE ("${MODEL_EXTRA}" STREQUAL "")
+  SET(MODEL_NAME "${PROJECT_NAME}-${MODEL_MAJOR}.${MODEL_MINOR}.${MODEL_PATCH}${MODEL_EXTRA}")
+ENDIF ("${MODEL_EXTRA}" STREQUAL "")
+
+#
+ # CPack configuration
+#
+
+INCLUDE(CMakeCPack.cmake)
+
+#
+ # Debug mode
+#
+
+IF (CMAKE_COMPILER_IS_GNUCC AND CMAKE_COMPILER_IS_GNUCXX)
+  SET(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Wall -Wextra")
+  SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -Wextra -std=c++11 -pthread")
+  IF (UNIX)
+    SET(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -pedantic")
+    SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -pedantic")
+  ENDIF (UNIX)
+ENDIF (CMAKE_COMPILER_IS_GNUCC AND CMAKE_COMPILER_IS_GNUCXX)
+
+if (CMAKE_BUILD_TYPE STREQUAL "")
+  SET(CMAKE_BUILD_TYPE "RelWithDebInfo" CACHE STRING "Choose the type of build" FORCE)
+endif ()
+
+#
+ # Modules
+#
+
+INCLUDE(CheckIncludeFileCXX)
+INCLUDE(CheckIncludeFile)
+INCLUDE(CheckLibraryExists)
+INCLUDE(CMakeDetermineCCompiler)
+
+#
+ # Check libraries with pkgconfig
+#
+
+FIND_PACKAGE(PkgConfig REQUIRED)
+
+# FIXME use old-style link directories for now
+IF (COMMAND CMAKE_POLICY)
+  CMAKE_POLICY(SET CMP0003 OLD)
+ENDIF (COMMAND CMAKE_POLICY)
+
+PKG_CHECK_MODULES(PARADEVS REQUIRED paradevs-1.0)
+PKG_CHECK_MODULES(LIBXML REQUIRED libxml-2.0)
+#
+ # Test the libboost header and libboost-text library.
+#
+
+OPTION(WITH_TEST "use the libboost test unit library [default: on]" ON)
+SET(Boost_USE_MULTITHREADED ON)
+SET(Boost_USE_STATIC_LIBS OFF)
+SET(Boost_NO_SYSTEM_PATHS OFF)
+SET(Boost_USE_STATIC_RUNTIME ON)
+IF (WIN32)
+  SET(Boost_THREADAPI "win32")
+ENDIF (WIN32)
+SET(Boost_DETAILED_FAILURE_MSG FALSE)
+SET(Boost_DEBUG FALSE)
+
+FIND_PACKAGE(Boost COMPONENTS graph timer system)
+IF (NOT Boost_GRAPH_FOUND)
+  MESSAGE(FATAL_ERROR "The boost graph library is required")
+ENDIF (NOT Boost_GRAPH_FOUND)
+IF (Boost_MINOR_VERSION AND ${Boost_MINOR_VERSION} LESS "35")
+  SET(Boost_SYSTEM_LIBRARY "")
+ENDIF (Boost_MINOR_VERSION AND ${Boost_MINOR_VERSION} LESS "35")
+IF (Boost_MINOR_VERSION AND ${Boost_MINOR_VERSION} LESS "41")
+  SET(PARADEVS_HAVE_BOOST_SPIRIT2 0 CACHE INTERNAL "" FORCE)
+ELSE (Boost_MINOR_VERSION AND ${Boost_MINOR_VERSION} LESS "41")
+  SET(PARADEVS_HAVE_BOOST_SPIRIT2 1 CACHE INTERNAL "" FORCE)
+ENDIF (Boost_MINOR_VERSION AND ${Boost_MINOR_VERSION} LESS "41")
+
+#
+ # Generate the config.h
+#
+
+CHECK_INCLUDE_FILE_CXX(cxxabi.h PARADEVS_HAVE_GCC_ABI_DEMANGLE)
+CHECK_INCLUDE_FILE_CXX(execinfo.h PARADEVS_HAVE_EXECINFO)
+CHECK_INCLUDE_FILE_CXX(signal.h PARADEVS_HAVE_SIGNAL)
+INCLUDE_DIRECTORIES(${PARADEVS_BINARY_DIR})
+
+#
+ # Browse the src subdirectory
+#
+
+ADD_SUBDIRECTORY(src)
+
+#
+ # Status
+#
+
+MESSAGE(STATUS "- - - -")
+MESSAGE(STATUS "${PARADEVS_NAME_COMPLETE} configured successfully")
+MESSAGE(STATUS "Using ${CMAKE_INSTALL_PREFIX} for installation")
+MESSAGE(STATUS "Build type ${CMAKE_BUILD_TYPE}")
+IF (PARADEVS_HAVE_GCC_ABI_DEMANGLE)
+  MESSAGE(STATUS "Build with GCC ABI Demangle...: yes")
+ENDIF (PARADEVS_HAVE_GCC_ABI_DEMANGLE)
+IF (PARADEVS_HAVE_EXECINFO)
+  MESSAGE(STATUS "Build with execinfo.h.........: yes")
+ENDIF (PARADEVS_HAVE_EXECINFO)
+IF (Boost_FOUND)
+  MESSAGE(STATUS "Build with boost..............: yes")
+ENDIF (Boost_FOUND)
+MESSAGE(STATUS "- - - -")
+
+# vim:tw=0:ts=8:tw=0:sw=2:sts=2

+ 676 - 0
COPYING

@@ -0,0 +1,676 @@
+
+		    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>.
+

+ 32 - 0
README

@@ -0,0 +1,32 @@
+Paradevs : DEVS multimodeling and simulation framework
+======================================================
+
+See AUTHORS and COPYRIGHT for the list of contributors.
+
+PARADEVS is a framework for multimodeling and simulation of complex dynamical
+systems. It addresses the reliability issue by using recent
+developments in the theory of modeling and simulation proposed by B. Zeigler
+with the Discrete Event System Specification formalism (DEVS).
+
+
+Requirements
+------------
+
+For the simulator and API only:
+    boost	1.34  http://www.boost.org
+
+To build VLE you need:
+    cmake	2.6.0 http://www.cmake.org
+    make	1.8
+    gcc, g++	4.6 minimum
+
+
+Getting the code
+----------------
+
+The source tree is currently hosted on SourceforgeGitHub. To view the repository
+online :
+    https://github.com//vle-labs/paradevs
+
+The URL to clone it:
+    git@github.com:vle-labs/paradevs.git

BIN
doc/comparison.ods


+ 8 - 0
src/CMakeLists.txt

@@ -0,0 +1,8 @@
+IF ("${CMAKE_BUILD_TYPE}" STREQUAL "Debug")
+  message("TRACE on")
+  add_definitions(-DWITH_TRACE)
+ELSE ("${CMAKE_BUILD_TYPE}" STREQUAL "Debug")
+  message("TRACE off")
+ENDIF ("${CMAKE_BUILD_TYPE}" STREQUAL "Debug")
+
+ADD_SUBDIRECTORY(tests)

+ 18 - 0
src/tests/CMakeLists.txt

@@ -0,0 +1,18 @@
+INCLUDE_DIRECTORIES(
+  ${PARADEVS_BINARY_DIR}/src
+  ${PARADEVS_SOURCE_DIR}/src
+  ${Boost_INCLUDE_DIRS}
+  ${GLIBMM_INCLUDE_DIRS}
+  ${LIBXML_INCLUDE_DIRS})
+
+LINK_DIRECTORIES(
+  ${GLIBMM_LIBRARY_DIRS}
+  ${LIBXML_LIBRARY_DIR})
+
+ADD_SUBDIRECTORY(boost_graph)
+ADD_SUBDIRECTORY(common)
+ADD_SUBDIRECTORY(corsen)
+ADD_SUBDIRECTORY(dtss)
+ADD_SUBDIRECTORY(mixed)
+ADD_SUBDIRECTORY(multithreading)
+ADD_SUBDIRECTORY(pdevs)

+ 22 - 0
src/tests/boost_graph/CMakeLists.txt

@@ -0,0 +1,22 @@
+INCLUDE_DIRECTORIES(
+  ${CMAKE_SOURCE_DIR}/src
+  ${PARADEVS_INCLUDE_DIRS}
+  ${Boost_INCLUDE_DIRS}
+  ${GLIBMM_INCLUDE_DIRS}
+  ${LIBXML_INCLUDE_DIRS})
+
+LINK_DIRECTORIES(
+  ${GLIBMM_LIBRARY_DIRS}
+  ${LIBXML_LIBRARY_DIR})
+
+# graph tests
+ADD_EXECUTABLE(graph-tests graph_builder.hpp graph_defs.hpp graph_manager.hpp
+  graph_partitioning.hpp tests.cpp models.hpp)
+
+TARGET_LINK_LIBRARIES(graph-tests partitioning
+  ${Boost_LIBRARIES}
+  ${GLIBMM_LIBRARIES}
+  ${LIBXML_LIBRARIES}
+  ${GTHREAD_LIBRARIES})
+
+ADD_SUBDIRECTORY(partitioning)

+ 466 - 0
src/tests/boost_graph/graph_builder.hpp

@@ -0,0 +1,466 @@
+/**
+ * @file tests/boost_graph/graph_builder.hpp
+ * @author The PARADEVS Development Team
+ * See the AUTHORS or Authors.txt file
+ */
+
+/*
+ * PARADEVS - the multimodeling and simulation environment
+ * This file is a part of the PARADEVS environment
+ *
+ * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
+ *
+ * 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/>.
+ */
+
+#ifndef __TESTS_BOOST_GRAPH_GRAPH_BUILDER_HPP
+#define __TESTS_BOOST_GRAPH_GRAPH_BUILDER_HPP 1
+
+#include <tests/boost_graph/graph_defs.hpp>
+
+namespace paradevs { namespace tests { namespace boost_graph {
+
+class FlatGraphBuilder
+{
+public:
+    FlatGraphBuilder()
+    { }
+
+    void build(OrientedGraphs& graphs, InputEdgeList& /* input_edges */,
+               OutputEdgeList& /* output_edges */,
+               Connections& /* parent_connections */)
+    {
+        OrientedGraph graph;
+
+        OrientedGraph::vertex_descriptor v0 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v1 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v2 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v3 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v4 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v5 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v6 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v7 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v8 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v9 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v10 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v11 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v12 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v13 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v14 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v15 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v16 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v17 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v18 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v19 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v20 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v21 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v22 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v23 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v24 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v25 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v26 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v27 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v28 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v29 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v30 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v31 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v32 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v33 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v34 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v35 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v36 = boost::add_vertex(graph);
+        OrientedGraph::vertex_descriptor v37 = boost::add_vertex(graph);
+
+        boost::add_edge(v1, v0, 1., graph);
+        boost::add_edge(v2, v0, 1., graph);
+        boost::add_edge(v3, v0, 1., graph);
+        boost::add_edge(v1, v2, 1., graph);
+        boost::add_edge(v4, v1, 1., graph);
+        boost::add_edge(v5, v1, 1., graph);
+        boost::add_edge(v6, v1, 1., graph);
+        boost::add_edge(v6, v2, 1., graph);
+        boost::add_edge(v2, v3, 1., graph);
+        boost::add_edge(v9, v3, 1., graph);
+        boost::add_edge(v10, v3 , 1., graph);
+        boost::add_edge(v4, v5, 1., graph);
+        boost::add_edge(v5, v6, 1., graph);
+        boost::add_edge(v7, v4, 1., graph);
+        boost::add_edge(v8, v4, 1., graph);
+        boost::add_edge(v7, v8, 1., graph);
+        boost::add_edge(v9, v10 , 1., graph);
+        boost::add_edge(v8, v11, 1., graph);
+        boost::add_edge(v11, v4, 1., graph);
+        boost::add_edge(v12, v13, 1., graph);
+        boost::add_edge(v12, v7, 1., graph);
+        boost::add_edge(v13, v7, 1., graph);
+        boost::add_edge(v14, v15, 1., graph);
+        boost::add_edge(v14, v12, 1., graph);
+        boost::add_edge(v15, v16, 1., graph);
+        boost::add_edge(v15, v12, 1., graph);
+        boost::add_edge(v16, v17, 1., graph);
+        boost::add_edge(v16, v12, 1., graph);
+        boost::add_edge(v17, v12, 1., graph);
+        boost::add_edge(v18, v19, 1., graph);
+        boost::add_edge(v18, v8, 1., graph);
+        boost::add_edge(v19, v20, 1., graph);
+        boost::add_edge(v19, v8, 1., graph);
+        boost::add_edge(v20, v8, 1., graph);
+        boost::add_edge(v21, v22, 1., graph);
+        boost::add_edge(v21, v19, 1., graph);
+        boost::add_edge(v22, v23, 1., graph);
+        boost::add_edge(v22, v19, 1., graph);
+        boost::add_edge(v23, v19, 1., graph);
+        boost::add_edge(v24, v25, 1., graph);
+        boost::add_edge(v24, v6, 1., graph);
+        boost::add_edge(v25, v6, 1., graph);
+        boost::add_edge(v26, v11, 1., graph);
+        boost::add_edge(v26, v27, 1., graph);
+        boost::add_edge(v26, v24, 1., graph);
+        boost::add_edge(v27, v24, 1., graph);
+        boost::add_edge(v28, v25, 1., graph);
+        boost::add_edge(v29, v27, 1., graph);
+        boost::add_edge(v29, v28, 1., graph);
+        boost::add_edge(v30, v27, 1., graph);
+        boost::add_edge(v30, v28, 1., graph);
+        boost::add_edge(v31, v32, 1., graph);
+        boost::add_edge(v31, v10, 1., graph);
+        boost::add_edge(v32, v33, 1., graph);
+        boost::add_edge(v32, v10, 1., graph);
+        boost::add_edge(v33, v10, 1., graph);
+        boost::add_edge(v34, v31, 1., graph);
+        boost::add_edge(v34, v35, 1., graph);
+        boost::add_edge(v35, v31, 1., graph);
+        boost::add_edge(v35, v32, 1., graph);
+        boost::add_edge(v36, v32, 1., graph);
+        boost::add_edge(v36, v37, 1., graph);
+        boost::add_edge(v36, v33, 1., graph);
+        boost::add_edge(v37, v33, 1., graph);
+
+        /*graph[v6] = VertexProperties(6, 1., NORMAL_PIXEL);
+        graph[v8] = VertexProperties(8, 1., NORMAL_PIXEL);
+        graph[v10] = VertexProperties(10, 1., NORMAL_PIXEL);
+        graph[v0] = VertexProperties(0, 1., NORMAL_PIXEL);
+        graph[v1] = VertexProperties(1, 1., NORMAL_PIXEL);
+        graph[v2] = VertexProperties(2, 1., NORMAL_PIXEL);
+        graph[v3] = VertexProperties(3, 1., NORMAL_PIXEL);
+        graph[v4] = VertexProperties(4, 1., NORMAL_PIXEL);
+        graph[v5] = VertexProperties(5, 1., NORMAL_PIXEL);
+        graph[v7] = VertexProperties(7, 1., TOP_PIXEL);
+        graph[v9] = VertexProperties(9, 1., TOP_PIXEL);*/
+
+        graph[v6] = VertexProperties(6, 2.5, NORMAL_PIXEL);
+        graph[v8] = VertexProperties(8, 2., NORMAL_PIXEL);
+        graph[v10] = VertexProperties(10, 2.5, NORMAL_PIXEL);
+        graph[v0] = VertexProperties(0, 4, NORMAL_PIXEL);
+        graph[v1] = VertexProperties(1, 3, NORMAL_PIXEL);
+        graph[v2] = VertexProperties(2, 3, NORMAL_PIXEL);
+        graph[v3] = VertexProperties(3, 3, NORMAL_PIXEL);
+        graph[v4] = VertexProperties(4, 2.5, NORMAL_PIXEL);
+        graph[v5] = VertexProperties(5, 2.5, NORMAL_PIXEL);
+        graph[v7] = VertexProperties(7, 2., NORMAL_PIXEL);
+        graph[v9] = VertexProperties(9, 2.5, TOP_PIXEL);
+        graph[v11] = VertexProperties(11, 2, NORMAL_PIXEL);
+        graph[v12] = VertexProperties(12, 1.5, NORMAL_PIXEL);
+        graph[v13] = VertexProperties(13, 1.5, NORMAL_PIXEL);
+        graph[v14] = VertexProperties(14, 1, TOP_PIXEL);
+        graph[v15] = VertexProperties(15, 1, NORMAL_PIXEL);
+        graph[v16] = VertexProperties(16, 1, NORMAL_PIXEL);
+        graph[v17] = VertexProperties(17, 1, NORMAL_PIXEL);
+        graph[v18] = VertexProperties(18, 1.5, TOP_PIXEL);
+        graph[v19] = VertexProperties(19, 1.5, NORMAL_PIXEL);
+        graph[v20] = VertexProperties(20, 1.5, NORMAL_PIXEL);
+        graph[v21] = VertexProperties(21, 1, TOP_PIXEL);
+        graph[v22] = VertexProperties(22, 1, NORMAL_PIXEL);
+        graph[v23] = VertexProperties(23, 1, NORMAL_PIXEL);
+        graph[v24] = VertexProperties(24, 2, NORMAL_PIXEL);
+        graph[v25] = VertexProperties(25, 2, NORMAL_PIXEL);
+        graph[v26] = VertexProperties(26, 1.5, TOP_PIXEL);
+        graph[v27] = VertexProperties(27, 1.5, NORMAL_PIXEL);
+        graph[v28] = VertexProperties(28, 1.5, NORMAL_PIXEL);
+        graph[v29] = VertexProperties(29, 1, TOP_PIXEL);
+        graph[v30] = VertexProperties(30, 1, TOP_PIXEL);
+        graph[v31] = VertexProperties(31, 2, NORMAL_PIXEL);
+        graph[v32] = VertexProperties(32, 2, NORMAL_PIXEL);
+        graph[v33] = VertexProperties(33, 2, NORMAL_PIXEL);
+        graph[v34] = VertexProperties(34, 1.5, TOP_PIXEL);
+        graph[v35] = VertexProperties(35, 1.5, NORMAL_PIXEL);
+        graph[v36] = VertexProperties(36, 1.5, TOP_PIXEL);
+        graph[v37] = VertexProperties(37, 1.5, NORMAL_PIXEL);
+
+
+        graphs.push_back(graph);
+    }
+};
+
+class HierarchicalGraphBuilder
+{
+public:
+    HierarchicalGraphBuilder()
+    { }
+
+    void build(OrientedGraphs& graphs, InputEdgeList& input_edges,
+               OutputEdgeList& output_edges, Connections& parent_connections)
+    {
+        // S1
+        {
+            OrientedGraph graph;
+
+            OrientedGraph::vertex_descriptor v1 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v4 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v5 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v7 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v8 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v11 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v12 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v13 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v14 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v15 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v16 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v17 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v18 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v19 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v20 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v21 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v22 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v23 = boost::add_vertex(graph);
+
+            boost::add_edge(v4, v1, 1., graph);
+            boost::add_edge(v5, v1, 1., graph);
+            boost::add_edge(v4, v5, 1., graph);
+            boost::add_edge(v7, v4, 1., graph);
+            boost::add_edge(v8, v4, 1., graph);
+            boost::add_edge(v7, v8, 1., graph);
+            boost::add_edge(v8, v11, 1., graph);
+            boost::add_edge(v11, v4, 1., graph);
+            boost::add_edge(v12, v13, 1., graph);
+            boost::add_edge(v12, v7, 1., graph);
+            boost::add_edge(v13, v7, 1., graph);
+            boost::add_edge(v14, v15, 1., graph);
+            boost::add_edge(v14, v12, 1., graph);
+            boost::add_edge(v15, v16, 1., graph);
+            boost::add_edge(v15, v12, 1., graph);
+            boost::add_edge(v16, v17, 1., graph);
+            boost::add_edge(v16, v12, 1., graph);
+            boost::add_edge(v17, v12, 1., graph);
+            boost::add_edge(v18, v19, 1., graph);
+            boost::add_edge(v18, v8, 1., graph);
+            boost::add_edge(v19, v20, 1., graph);
+            boost::add_edge(v19, v8, 1., graph);
+            boost::add_edge(v20, v8, 1., graph);
+            boost::add_edge(v21, v22, 1., graph);
+            boost::add_edge(v21, v19, 1., graph);
+            boost::add_edge(v22, v23, 1., graph);
+            boost::add_edge(v22, v19, 1., graph);
+            boost::add_edge(v23, v19, 1., graph);
+
+            graph[v8] = VertexProperties(8, 2., NORMAL_PIXEL);
+            graph[v1] = VertexProperties(1, 3, NORMAL_PIXEL);
+            graph[v4] = VertexProperties(4, 2.5, NORMAL_PIXEL);
+            graph[v5] = VertexProperties(5, 2.5, NORMAL_PIXEL);
+            graph[v7] = VertexProperties(7, 2., NORMAL_PIXEL);
+            graph[v11] = VertexProperties(11, 2, NORMAL_PIXEL);
+            graph[v12] = VertexProperties(12, 1.5, NORMAL_PIXEL);
+            graph[v13] = VertexProperties(13, 1.5, NORMAL_PIXEL);
+            graph[v14] = VertexProperties(14, 1, TOP_PIXEL);
+            graph[v15] = VertexProperties(15, 1, NORMAL_PIXEL);
+            graph[v16] = VertexProperties(16, 1, NORMAL_PIXEL);
+            graph[v17] = VertexProperties(17, 1, NORMAL_PIXEL);
+            graph[v18] = VertexProperties(18, 1.5, TOP_PIXEL);
+            graph[v19] = VertexProperties(19, 1.5, NORMAL_PIXEL);
+            graph[v20] = VertexProperties(20, 1.5, NORMAL_PIXEL);
+            graph[v21] = VertexProperties(21, 1, TOP_PIXEL);
+            graph[v22] = VertexProperties(22, 1, NORMAL_PIXEL);
+            graph[v23] = VertexProperties(23, 1, NORMAL_PIXEL);
+
+
+            /*OrientedGraph::vertex_descriptor v1 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v2 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v4 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v5 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v6 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v7 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v8 = boost::add_vertex(graph);
+
+            boost::add_edge(v1, v2, 1., graph);
+            boost::add_edge(v4, v1, 1., graph);
+            boost::add_edge(v5, v1, 1., graph);
+            boost::add_edge(v6, v1, 1., graph);
+            boost::add_edge(v6, v2, 1., graph);
+            boost::add_edge(v4, v5, 1., graph);
+            boost::add_edge(v5, v6, 1., graph);
+            boost::add_edge(v7, v4, 1., graph);
+            boost::add_edge(v8, v4, 1., graph);
+            boost::add_edge(v7, v8, 1., graph);
+
+            graph[v6] = VertexProperties(6, 1., NORMAL_PIXEL);
+            graph[v8] = VertexProperties(8, 1., NORMAL_PIXEL);
+            graph[v1] = VertexProperties(1, 1., NORMAL_PIXEL);
+            graph[v2] = VertexProperties(2, 1., NORMAL_PIXEL);
+            graph[v4] = VertexProperties(4, 1., NORMAL_PIXEL);
+            graph[v5] = VertexProperties(5, 1., NORMAL_PIXEL);
+            graph[v7] = VertexProperties(7, 1., TOP_PIXEL);*/
+
+            graphs.push_back(graph);
+        }
+        // S2
+        {
+            OrientedGraph graph;
+
+            OrientedGraph::vertex_descriptor v0 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v2 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v3 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v6 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v9 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v10 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v24 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v25 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v26 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v27 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v28 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v29 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v30 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v31 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v32 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v33 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v34 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v35 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v36 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v37 = boost::add_vertex(graph);
+
+            boost::add_edge(v2, v0, 1., graph);
+            boost::add_edge(v3, v0, 1., graph);
+            boost::add_edge(v6, v2, 1., graph);
+            boost::add_edge(v2, v3, 1., graph);
+            boost::add_edge(v9, v3, 1., graph);
+            boost::add_edge(v10, v3 , 1., graph);
+            boost::add_edge(v9, v10 , 1., graph);
+            boost::add_edge(v24, v25, 1., graph);
+            boost::add_edge(v24, v6, 1., graph);
+            boost::add_edge(v25, v6, 1., graph);
+            boost::add_edge(v26, v27, 1., graph);
+            boost::add_edge(v26, v24, 1., graph);
+            boost::add_edge(v27, v24, 1., graph);
+            boost::add_edge(v28, v25, 1., graph);
+            boost::add_edge(v29, v27, 1., graph);
+            boost::add_edge(v29, v28, 1., graph);
+            boost::add_edge(v30, v27, 1., graph);
+            boost::add_edge(v31, v32, 1., graph);
+            boost::add_edge(v31, v10, 1., graph);
+            boost::add_edge(v32, v33, 1., graph);
+            boost::add_edge(v32, v10, 1., graph);
+            boost::add_edge(v33, v10, 1., graph);
+            boost::add_edge(v34, v31, 1., graph);
+            boost::add_edge(v34, v35, 1., graph);
+            boost::add_edge(v35, v31, 1., graph);
+            boost::add_edge(v35, v32, 1., graph);
+            boost::add_edge(v36, v32, 1., graph);
+            boost::add_edge(v36, v37, 1., graph);
+            boost::add_edge(v36, v33, 1., graph);
+            boost::add_edge(v37, v33, 1., graph);
+
+            graph[v6] = VertexProperties(6, 2.5, NORMAL_PIXEL);
+            graph[v10] = VertexProperties(10, 2.5, NORMAL_PIXEL);
+            graph[v0] = VertexProperties(0, 4, NORMAL_PIXEL);
+            graph[v2] = VertexProperties(2, 3, NORMAL_PIXEL);
+            graph[v3] = VertexProperties(3, 3, NORMAL_PIXEL);
+            graph[v9] = VertexProperties(9, 2.5, TOP_PIXEL);
+            graph[v24] = VertexProperties(24, 2, NORMAL_PIXEL);
+            graph[v25] = VertexProperties(25, 2, NORMAL_PIXEL);
+            graph[v26] = VertexProperties(26, 1.5, TOP_PIXEL);
+            graph[v27] = VertexProperties(27, 1.5, NORMAL_PIXEL);
+            graph[v28] = VertexProperties(28, 1.5, NORMAL_PIXEL);
+            graph[v29] = VertexProperties(29, 1, TOP_PIXEL);
+            graph[v30] = VertexProperties(30, 1, TOP_PIXEL);
+            graph[v31] = VertexProperties(31, 2, NORMAL_PIXEL);
+            graph[v32] = VertexProperties(32, 2, NORMAL_PIXEL);
+            graph[v33] = VertexProperties(33, 2, NORMAL_PIXEL);
+            graph[v34] = VertexProperties(34, 1.5, TOP_PIXEL);
+            graph[v35] = VertexProperties(35, 1.5, NORMAL_PIXEL);
+            graph[v36] = VertexProperties(36, 1.5, TOP_PIXEL);
+            graph[v37] = VertexProperties(37, 1.5, NORMAL_PIXEL);
+
+            /*OrientedGraph::vertex_descriptor v0 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v3 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v9 = boost::add_vertex(graph);
+            OrientedGraph::vertex_descriptor v10 = boost::add_vertex(graph);
+
+            boost::add_edge(v3, v0, 1., graph);
+            boost::add_edge(v10, v3, 1., graph);
+            boost::add_edge(v9, v10, 1., graph);
+            boost::add_edge(v9, v3, 1., graph);
+
+            graph[v10] = VertexProperties(10, 1., NORMAL_PIXEL);
+            graph[v0] = VertexProperties(0, 1., NORMAL_PIXEL);
+            graph[v3] = VertexProperties(3, 1., NORMAL_PIXEL);
+            graph[v9] = VertexProperties(9, 1., TOP_PIXEL);*/
+
+            graphs.push_back(graph);
+        }
+        {
+
+            /*// input S1
+            input_edges.push_back(InputEdges());
+            // input S2
+            input_edges.push_back(InputEdges());
+            input_edges[1].push_back(Edge(1, 0));
+            input_edges[1].push_back(Edge(2, 0));
+            input_edges[1].push_back(Edge(2, 3));
+
+            // output S1
+            output_edges.push_back(OutputEdges());
+            output_edges[0].push_back(Edge(1, 0));
+            output_edges[0].push_back(Edge(2, 0));
+            output_edges[0].push_back(Edge(2, 3));
+            // output S2
+            output_edges.push_back(OutputEdges());
+
+            // parent
+            parent_connections.push_back(Connection(Port(1,1),Port(2,0)));
+            parent_connections.push_back(Connection(Port(1,2),Port(2,0)));
+            parent_connections.push_back(Connection(Port(1,2),Port(2,3)));*/
+
+
+            // input S1
+            input_edges.push_back(InputEdges());
+            input_edges[0].push_back(Edge(6, 1));
+            input_edges[0].push_back(Edge(26, 11));
+            // input S2
+            input_edges.push_back(InputEdges());
+            input_edges[1].push_back(Edge(1, 0));
+            input_edges[1].push_back(Edge(1, 2));
+            input_edges[1].push_back(Edge(5, 6));
+
+            // output S1
+            output_edges.push_back(OutputEdges());
+            output_edges[0].push_back(Edge(1, 0));
+            output_edges[0].push_back(Edge(1, 2));
+            output_edges[0].push_back(Edge(5, 6));
+            // output S2
+            output_edges.push_back(OutputEdges());
+            output_edges[1].push_back(Edge(6, 1));
+            output_edges[1].push_back(Edge(26, 11));
+
+            // parent
+            parent_connections.push_back(Connection(Port(1,1),Port(2,0)));
+            parent_connections.push_back(Connection(Port(1,1),Port(2,2)));
+            parent_connections.push_back(Connection(Port(1,5),Port(2,6)));
+            parent_connections.push_back(Connection(Port(2,6),Port(1,1)));
+            parent_connections.push_back(Connection(Port(2,26),Port(1,11)));
+        }
+    }
+};
+
+} } } // namespace paradevs tests boost_graph
+
+#endif

+ 78 - 0
src/tests/boost_graph/graph_defs.hpp

@@ -0,0 +1,78 @@
+/**
+ * @file tests/boost_graph/graph_defs.hpp
+ * @author The PARADEVS Development Team
+ * See the AUTHORS or Authors.txt file
+ */
+
+/*
+ * PARADEVS - the multimodeling and simulation environment
+ * This file is a part of the PARADEVS environment
+ *
+ * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
+ *
+ * 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/>.
+ */
+
+#ifndef __TESTS_BOOST_GRAPH_GRAPH_DEFS_HPP
+#define __TESTS_BOOST_GRAPH_GRAPH_DEFS_HPP 1
+
+#include <boost/graph/adjacency_list.hpp>
+
+namespace paradevs { namespace tests { namespace boost_graph {
+
+enum DynamicsType {
+    TOP_PIXEL = 0, NORMAL_PIXEL
+};
+
+struct VertexProperties
+{
+    int          _index;
+    double       _weight;
+    DynamicsType _type;
+
+    VertexProperties() : _index(0), _weight(0), _type(NORMAL_PIXEL)
+    { }
+    VertexProperties(int index, double weight, DynamicsType type) :
+        _index(index), _weight(weight), _type(type)
+    { }
+};
+
+struct EdgeProperties
+{
+    double       _weight;
+
+    EdgeProperties() : _weight(0)
+    { }
+    EdgeProperties(double weight) : _weight(weight)
+    { }
+};
+
+typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::directedS,
+                                VertexProperties, EdgeProperties> OrientedGraph;
+typedef std::vector < OrientedGraph > OrientedGraphs;
+
+typedef std::pair < int, int > Edge;
+typedef std::vector < Edge > Edges;
+typedef Edges OutputEdges;
+typedef Edges InputEdges;
+typedef std::vector < OutputEdges > OutputEdgeList;
+typedef std::vector < InputEdges > InputEdgeList;
+
+typedef std::pair < int, int > Port;
+typedef std::pair < Port, Port > Connection;
+typedef std::vector < Connection > Connections;
+
+} } } // namespace paradevs tests boost_graph
+
+#endif

+ 758 - 0
src/tests/boost_graph/graph_manager.hpp

@@ -0,0 +1,758 @@
+/**
+ * @file tests/boost_graph/graph_manager.hpp
+ * @author The PARADEVS Development Team
+ * See the AUTHORS or Authors.txt file
+ */
+
+/*
+ * PARADEVS - the multimodeling and simulation environment
+ * This file is a part of the PARADEVS environment
+ *
+ * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
+ *
+ * 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/>.
+ */
+
+#ifndef __TESTS_BOOST_GRAPH_GRAPH_MANAGER_HPP
+#define __TESTS_BOOST_GRAPH_GRAPH_MANAGER_HPP 1
+
+#include <paradevs/common/scheduler/HeapScheduler.hpp>
+#include <paradevs/common/scheduler/VectorScheduler.hpp>
+
+#include <paradevs/kernel/pdevs/Coordinator.hpp>
+#include <paradevs/kernel/pdevs/GraphManager.hpp>
+#include <paradevs/kernel/pdevs/Simulator.hpp>
+
+#include <paradevs/kernel/pdevs/multithreading/Coordinator.hpp>
+
+#include <tests/boost_graph/models.hpp>
+#include <tests/boost_graph/graph_partitioning.hpp>
+
+namespace paradevs { namespace tests { namespace boost_graph {
+
+struct SchedulerHandle;
+
+typedef typename paradevs::common::scheduler::HeapScheduler <
+    common::DoubleTime, SchedulerHandle >::type SchedulerType;
+
+struct SchedulerHandle
+{
+    SchedulerHandle()
+    { }
+
+    SchedulerHandle(const SchedulerType::handle_type& handle)
+        : _handle(handle)
+    { }
+
+    const SchedulerHandle& handle() const
+    { return *this; }
+
+    void handle(const SchedulerHandle& handle)
+    { _handle = handle._handle; }
+
+    SchedulerType::handle_type _handle;
+};
+
+struct GraphParameters
+{
+    OrientedGraph _graph;
+    InputEdges    _input_edges;
+    OutputEdges   _output_edges;
+
+    GraphParameters(const OrientedGraph& graph,
+                    const InputEdges& input_edges,
+                    const OutputEdges& output_edges) :
+        _graph(graph), _input_edges(input_edges), _output_edges(output_edges)
+    { }
+};
+
+template < class SchedulerHandle, class Parameters >
+class FlatGraphManager :
+        public paradevs::pdevs::GraphManager < common::DoubleTime,
+                                               SchedulerHandle,
+                                               Parameters >
+{
+public:
+    FlatGraphManager(common::Coordinator < common::DoubleTime,
+                                           SchedulerHandle >* coordinator,
+        const Parameters& parameters) :
+        paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
+                                        Parameters >(
+            coordinator, parameters)
+    { }
+
+    virtual ~FlatGraphManager()
+    {
+        for (typename TopSimulators::const_iterator it =
+                 _top_simulators.begin(); it != _top_simulators.end();
+             ++it) {
+            delete it->second;
+        }
+        for (typename NormalSimulators::const_iterator it =
+                 _normal_simulators.begin(); it != _normal_simulators.end();
+             ++it) {
+            delete it->second;
+        }
+    }
+
+    void build_flat_graph(const OrientedGraph& g, const InputEdges& inputs)
+    {
+        OrientedGraph::vertex_iterator vertexIt, vertexEnd;
+
+        boost::tie(vertexIt, vertexEnd) = boost::vertices(g);
+        for (; vertexIt != vertexEnd; ++vertexIt) {
+            std::ostringstream ss;
+
+            ss << "a" << g[*vertexIt]._index;
+            switch (g[*vertexIt]._type) {
+            case TOP_PIXEL:
+                _top_simulators[g[*vertexIt]._index] =
+                    new pdevs::Simulator <
+                        common::DoubleTime, TopPixel < SchedulerHandle >,
+                        SchedulerHandle,
+                        TopPixelParameters >(ss.str(), TopPixelParameters());
+                _top_simulators[g[*vertexIt]._index]->add_out_port("out");
+                FlatGraphManager < SchedulerHandle, Parameters >::add_child(
+                    _top_simulators[g[*vertexIt]._index]);
+                break;
+            case NORMAL_PIXEL:
+                unsigned int n = 0;
+                OrientedGraph::vertex_iterator vertexIt2, vertexEnd2;
+
+                boost::tie(vertexIt2, vertexEnd2) = boost::vertices(g);
+                for (; vertexIt2 != vertexEnd2; ++vertexIt2) {
+                    OrientedGraph::adjacency_iterator neighbourIt, neighbourEnd;
+
+                    boost::tie(neighbourIt, neighbourEnd) =
+                        boost::adjacent_vertices(*vertexIt2, g);
+                    for (; neighbourIt != neighbourEnd; ++neighbourIt) {
+                        if (g[*neighbourIt]._index == g[*vertexIt]._index) {
+                            ++n;
+                        }
+                    }
+                }
+
+                for (InputEdges::const_iterator it = inputs.begin();
+                     it != inputs.end(); ++it) {
+                    if (g[*vertexIt]._index == it->second) {
+                        ++n;
+                    }
+                }
+                _normal_simulators[g[*vertexIt]._index] =
+                    new pdevs::Simulator <
+                        common::DoubleTime, NormalPixel < SchedulerHandle >,
+                        SchedulerHandle, NormalPixelParameters >(
+                            ss.str(), NormalPixelParameters(n));
+                _normal_simulators[g[*vertexIt]._index]->add_in_port("in");
+                _normal_simulators[g[*vertexIt]._index]->add_out_port("out");
+                FlatGraphManager < SchedulerHandle, Parameters >::add_child(
+                    _normal_simulators[g[*vertexIt]._index]);
+                break;
+            };
+        }
+
+        boost::tie(vertexIt, vertexEnd) = boost::vertices(g);
+        for (; vertexIt != vertexEnd; ++vertexIt)
+        {
+            OrientedGraph::adjacency_iterator neighbourIt, neighbourEnd;
+
+            boost::tie(neighbourIt, neighbourEnd) =
+                boost::adjacent_vertices(*vertexIt, g);
+            for (; neighbourIt != neighbourEnd; ++neighbourIt) {
+                paradevs::common::Model < common::DoubleTime,
+                                          SchedulerHandle >* a = 0;
+                paradevs::common::Model < common::DoubleTime,
+                                          SchedulerHandle >* b = 0;
+
+                if (g[*vertexIt]._type == TOP_PIXEL) {
+                    a = _top_simulators[g[*vertexIt]._index];
+                } else {
+                    a = _normal_simulators[g[*vertexIt]._index];
+                }
+                if (g[*neighbourIt]._type == TOP_PIXEL) {
+                    b = _top_simulators[g[*neighbourIt]._index];
+                } else {
+                    b = _normal_simulators[g[*neighbourIt]._index];
+                }
+                FlatGraphManager < SchedulerHandle,
+                                   Parameters >::add_link(a, "out",
+                                                          b, "in");
+            }
+        }
+    }
+
+protected:
+    typedef std::map < int, pdevs::Simulator <
+                                common::DoubleTime,
+                                TopPixel < SchedulerHandle >,
+                                SchedulerHandle,
+                                TopPixelParameters >* > TopSimulators;
+    typedef std::map < int, pdevs::Simulator <
+                                common::DoubleTime,
+                                NormalPixel < SchedulerHandle >,
+                                SchedulerHandle,
+                                NormalPixelParameters >* > NormalSimulators;
+
+    TopSimulators    _top_simulators;
+    NormalSimulators _normal_simulators;
+};
+
+template < class SchedulerHandle >
+class BuiltFlatGraphManager :
+        public FlatGraphManager < SchedulerHandle, GraphParameters >
+{
+public:
+    BuiltFlatGraphManager(
+        common::Coordinator < common::DoubleTime,
+                              SchedulerHandle >* coordinator,
+        const GraphParameters& parameters) :
+        FlatGraphManager < SchedulerHandle, GraphParameters >(
+            coordinator, parameters)
+    {
+        BuiltFlatGraphManager < SchedulerHandle >::build_flat_graph(
+            parameters._graph, parameters._input_edges);
+        // input
+
+        // std::cout << "Input edges:" << std::endl;
+
+        for (Edges::const_iterator it = parameters._input_edges.begin();
+             it != parameters._input_edges.end(); ++it) {
+            std::ostringstream ss_in;
+
+            ss_in << "in_" << it->first;
+            if (not coordinator->exist_in_port(ss_in.str())) {
+                coordinator->add_in_port(ss_in.str());
+            }
+            BuiltFlatGraphManager < SchedulerHandle>::add_link(
+                coordinator, ss_in.str(),
+                BuiltFlatGraphManager <
+                    SchedulerHandle >::_normal_simulators[it->second], "in");
+
+            // std::cout << "link = " << coordinator->get_name()
+            //           << "::" << ss_in.str() << " -> "
+            //           << BuiltFlatGraphManager <
+            //               SchedulerHandle >::_normal_simulators[it->second]
+            //     ->get_name() << "::" << "in" << std::endl;
+
+        }
+        // output
+
+        // std::cout << "Output edges:" << std::endl;
+
+        for (Edges::const_iterator it = parameters._output_edges.begin();
+             it != parameters._output_edges.end(); ++it) {
+            std::ostringstream ss_out;
+
+            ss_out << "out_" << it->first;
+            if (not coordinator->exist_out_port(ss_out.str())) {
+                coordinator->add_out_port(ss_out.str());
+            }
+
+            if (BuiltFlatGraphManager <
+                    SchedulerHandle >::_normal_simulators.find(it->first) !=
+                BuiltFlatGraphManager <
+                    SchedulerHandle >::_normal_simulators.end()) {
+                if (not BuiltFlatGraphManager < SchedulerHandle>::exist_link(
+                        BuiltFlatGraphManager <
+                            SchedulerHandle >::_normal_simulators[it->first],
+                        "out", coordinator, ss_out.str())) {
+                    BuiltFlatGraphManager < SchedulerHandle>::add_link(
+                        BuiltFlatGraphManager <
+                            SchedulerHandle >::_normal_simulators[it->first],
+                        "out", coordinator, ss_out.str());
+
+                    // std::cout << "link = " << BuiltFlatGraphManager <
+                    //     SchedulerHandle >::_normal_simulators[it->first]
+                    //     ->get_name() << "::" << "out -> "
+                    //           << coordinator->get_name()
+                    //           << "::" << ss_out.str()
+                    //           << std::endl;
+                }
+            } else {
+                if (not BuiltFlatGraphManager < SchedulerHandle>::exist_link(
+                        BuiltFlatGraphManager <
+                            SchedulerHandle >::_top_simulators[it->first],
+                        "out", coordinator, ss_out.str())) {
+                    BuiltFlatGraphManager < SchedulerHandle>::add_link(
+                        BuiltFlatGraphManager <
+                            SchedulerHandle >::_top_simulators[it->first],
+                        "out", coordinator, ss_out.str());
+
+                    // std::cout << "link = " << BuiltFlatGraphManager <
+                    //     SchedulerHandle >::_top_simulators[it->first]
+                    //     ->get_name() << "::" << "out -> "
+                    //           << coordinator->get_name()
+                    //           << "::" << ss_out.str()
+                    //           << std::endl;
+
+                }
+            }
+        }
+    }
+
+    virtual ~BuiltFlatGraphManager()
+    { }
+};
+
+template < class SchedulerHandle >
+class ParallelBuiltFlatGraphManager :
+        public FlatGraphManager < SchedulerHandle, GraphParameters >
+{
+public:
+    ParallelBuiltFlatGraphManager(
+        common::Coordinator < common::DoubleTime,
+                              SchedulerHandle >* coordinator,
+        const GraphParameters& parameters) :
+        FlatGraphManager < SchedulerHandle, GraphParameters >(
+            coordinator, parameters)
+    {
+        ParallelBuiltFlatGraphManager < SchedulerHandle >::build_flat_graph(
+            parameters._graph, parameters._input_edges);
+        // input
+        for (Edges::const_iterator it = parameters._input_edges.begin();
+             it != parameters._input_edges.end(); ++it) {
+            std::ostringstream ss_in;
+
+            ss_in << "in_" << it->first;
+            if (not coordinator->exist_in_port(ss_in.str())) {
+                coordinator->add_in_port(ss_in.str());
+            }
+            ParallelBuiltFlatGraphManager < SchedulerHandle>::add_link(
+                coordinator, ss_in.str(),
+                ParallelBuiltFlatGraphManager <
+                    SchedulerHandle >::_normal_simulators[it->second], "in");
+        }
+        // output
+        for (Edges::const_iterator it = parameters._output_edges.begin();
+             it != parameters._output_edges.end(); ++it) {
+            std::ostringstream ss_out;
+
+            ss_out << "out_" << it->first;
+            if (not coordinator->exist_out_port(ss_out.str())) {
+                coordinator->add_out_port(ss_out.str());
+            }
+            if (not ParallelBuiltFlatGraphManager < SchedulerHandle >::exist_link(
+                ParallelBuiltFlatGraphManager <
+                    SchedulerHandle >::_normal_simulators[it->first], "out",
+                coordinator, ss_out.str())) {
+                ParallelBuiltFlatGraphManager < SchedulerHandle>::add_link(
+                    ParallelBuiltFlatGraphManager <
+                        SchedulerHandle >::_normal_simulators[it->first], "out",
+                    coordinator, ss_out.str());
+            }
+        }
+    }
+
+    void init()
+    { }
+
+    void start(common::DoubleTime::type /* t */)
+    { }
+
+    void transition(
+        const common::Models < common::DoubleTime,
+                               SchedulerHandle >& /* receivers */,
+        common::DoubleTime::type /* t */)
+    { }
+
+    virtual ~ParallelBuiltFlatGraphManager()
+    { }
+};
+
+template < class SchedulerHandle, class GraphBuilder >
+class InBuildFlatGraphManager :
+        public FlatGraphManager < SchedulerHandle,
+                                  paradevs::common::NoParameters >
+{
+public:
+    InBuildFlatGraphManager(
+        common::Coordinator < common::DoubleTime,
+                              SchedulerHandle >* coordinator,
+        const paradevs::common::NoParameters& parameters) :
+        FlatGraphManager < SchedulerHandle, paradevs::common::NoParameters >(
+            coordinator, parameters)
+    {
+        GraphBuilder   builder;
+        OrientedGraphs graphs;
+        InputEdgeList  input_edges;
+        OutputEdgeList output_edges;
+        Connections    parent_connections;
+
+        builder.build(graphs, input_edges, output_edges, parent_connections);
+        InBuildFlatGraphManager < SchedulerHandle,
+                                  GraphBuilder >::build_flat_graph(
+                                      graphs.front(), InputEdges());
+    }
+
+    virtual ~InBuildFlatGraphManager()
+    { }
+};
+
+struct PartitioningParameters
+{
+    int         cluster_number;
+    std::string partitioning_method_name;
+    int         contraction_coef;
+    bool        contraction_coef_flag;
+
+    PartitioningParameters(int cn,
+                           const std::string& pmn,
+                           int cc, bool ccf) :
+        cluster_number(cn), partitioning_method_name(pmn),
+        contraction_coef(cc), contraction_coef_flag(ccf)
+    { }
+};
+
+template < class SchedulerHandle, class GraphBuilder >
+class HeapHierarchicalGraphManager :
+        public paradevs::pdevs::GraphManager < common::DoubleTime,
+                                               SchedulerHandle,
+                                               PartitioningParameters >
+{
+public:
+    HeapHierarchicalGraphManager(
+        common::Coordinator < common::DoubleTime,
+                              SchedulerHandle >* coordinator,
+        const PartitioningParameters& parameters) :
+        paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
+                                        PartitioningParameters >(
+                                            coordinator, parameters)
+    {
+        GraphBuilder graph_builder(parameters.cluster_number,
+                                   parameters.partitioning_method_name,
+                                   parameters.contraction_coef,
+                                   parameters.contraction_coef_flag);
+        OrientedGraphs graphs;
+        InputEdgeList  input_edges;
+        OutputEdgeList output_edges;
+        Connections    parent_connections;
+
+        graph_builder.build(graphs, input_edges, output_edges,
+                            parent_connections);
+
+        // build coordinators (graphs)
+        for (unsigned int i = 0; i < graphs.size(); ++i) {
+            Coordinator* coordinator = 0;
+            std::ostringstream ss;
+
+            ss << "S" << i;
+            coordinator =
+                new Coordinator(ss.str(), paradevs::common::NoParameters(),
+                                GraphParameters(graphs[i], input_edges[i],
+                                                output_edges[i]));
+            _coordinators.push_back(coordinator);
+            HeapHierarchicalGraphManager < SchedulerHandle,
+                                           GraphBuilder >::add_child(
+                                               coordinator);
+
+        }
+
+        // std::cout << "Root:" << std::endl;
+
+        // builds internal connections (edges)
+        for (Connections::const_iterator it = parent_connections.begin();
+             it != parent_connections.end(); ++it) {
+            const Connection& connection = *it;
+            std::ostringstream ss_out;
+            std::ostringstream ss_in;
+
+            ss_out << "out_" << connection.first.second;
+            ss_in << "in_" << connection.first.second;
+
+            if (not HeapHierarchicalGraphManager <
+                    SchedulerHandle, GraphBuilder >::exist_link(
+                        _coordinators[connection.first.first - 1],
+                        ss_out.str(),
+                        _coordinators[connection.second.first - 1],
+                        ss_in.str())) {
+
+                // std::cout << "link = "
+                //           << _coordinators[connection.first.first - 1]
+                //     ->get_name()
+                //           << "::" << ss_out.str() << " -> "
+                //           << _coordinators[connection.second.first - 1]
+                //     ->get_name()
+                //           << "::" << ss_in.str() << std::endl;
+
+                HeapHierarchicalGraphManager <
+                    SchedulerHandle, GraphBuilder >::add_link(
+                        _coordinators[connection.first.first - 1],
+                        ss_out.str(),
+                        _coordinators[connection.second.first - 1],
+                        ss_in.str());
+            }
+        }
+    }
+
+    virtual ~HeapHierarchicalGraphManager()
+    {
+        for (typename Coordinators::const_iterator it = _coordinators.begin();
+             it != _coordinators.end(); ++it) {
+            delete *it;
+        }
+    }
+
+private:
+    typedef paradevs::pdevs::Coordinator <
+        common::DoubleTime,
+        SchedulerType,
+        SchedulerHandle,
+        BuiltFlatGraphManager < SchedulerHandle >,
+        common::NoParameters,
+        GraphParameters > Coordinator;
+    typedef std::vector < Coordinator* > Coordinators;
+
+    Coordinators _coordinators;
+};
+
+template < class SchedulerHandle, class GraphBuilder >
+class VectorHierarchicalGraphManager :
+        public paradevs::pdevs::GraphManager < common::DoubleTime,
+                                               SchedulerHandle,
+                                               PartitioningParameters >
+{
+public:
+    VectorHierarchicalGraphManager(
+        common::Coordinator < common::DoubleTime,
+                              SchedulerHandle >* coordinator,
+        const PartitioningParameters& parameters) :
+        paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
+                                        PartitioningParameters >(
+                                            coordinator, parameters)
+    {
+        GraphBuilder   graph_builder(parameters.cluster_number,
+                                     parameters.partitioning_method_name,
+                                     parameters.contraction_coef,
+                                     parameters.contraction_coef_flag);
+        OrientedGraphs graphs;
+        InputEdgeList  input_edges;
+        OutputEdgeList output_edges;
+        Connections    parent_connections;
+
+        graph_builder.build(graphs, input_edges, output_edges,
+                            parent_connections);
+
+        // build coordinators (graphs)
+        for (unsigned int i = 0; i < graphs.size(); ++i) {
+            Coordinator* coordinator = 0;
+            std::ostringstream ss;
+
+            ss << "S" << i;
+            coordinator =
+                new Coordinator(ss.str(), paradevs::common::NoParameters(),
+                                GraphParameters(graphs[i], input_edges[i],
+                                                output_edges[i]));
+            _coordinators.push_back(coordinator);
+            VectorHierarchicalGraphManager < SchedulerHandle,
+                                             GraphBuilder >::add_child(
+                                                 coordinator);
+
+        }
+
+        // builds internal connections (edges)
+        for (Connections::const_iterator it = parent_connections.begin();
+             it != parent_connections.end(); ++it) {
+            const Connection& connection = *it;
+            std::ostringstream ss_out;
+            std::ostringstream ss_in;
+
+            ss_out << "out_" << connection.first.second;
+            ss_in << "in_" << connection.first.second;
+
+            if (not VectorHierarchicalGraphManager <
+                    SchedulerHandle, GraphBuilder >::exist_link(
+                        _coordinators[connection.first.first - 1],
+                        ss_out.str(),
+                        _coordinators[connection.second.first - 1],
+                        ss_in.str())) {
+                VectorHierarchicalGraphManager <
+                    SchedulerHandle, GraphBuilder >::add_link(
+                        _coordinators[connection.first.first - 1],
+                        ss_out.str(),
+                        _coordinators[connection.second.first - 1],
+                        ss_in.str());
+            }
+        }
+    }
+
+    virtual ~VectorHierarchicalGraphManager()
+    {
+        for (typename Coordinators::const_iterator it = _coordinators.begin();
+             it != _coordinators.end(); ++it) {
+            delete *it;
+        }
+    }
+
+private:
+    typedef paradevs::pdevs::Coordinator <
+    common::DoubleTime,
+    paradevs::common::scheduler::VectorScheduler <
+        paradevs::common::DoubleTime >,
+    paradevs::common::scheduler::NoSchedulerHandle,
+    BuiltFlatGraphManager < paradevs::common::scheduler::NoSchedulerHandle >,
+    common::NoParameters,
+    GraphParameters > Coordinator;
+    typedef std::vector < Coordinator* > Coordinators;
+
+    Coordinators _coordinators;
+};
+
+template < class SchedulerHandle, class GraphBuilder >
+class ParallelHeapHierarchicalGraphManager :
+        public paradevs::pdevs::GraphManager < common::DoubleTime,
+                                               SchedulerHandle,
+                                               PartitioningParameters >
+{
+public:
+    ParallelHeapHierarchicalGraphManager(
+        common::Coordinator < common::DoubleTime,
+                              SchedulerHandle >* coordinator,
+        const PartitioningParameters& parameters) :
+        paradevs::pdevs::GraphManager < common::DoubleTime, SchedulerHandle,
+                                        PartitioningParameters >(
+                                            coordinator, parameters)
+    {
+        GraphBuilder   graph_builder(parameters.cluster_number,
+                                     parameters.partitioning_method_name,
+                                     parameters.contraction_coef,
+                                     parameters.contraction_coef_flag);
+        OrientedGraphs graphs;
+        InputEdgeList  input_edges;
+        OutputEdgeList output_edges;
+        Connections    parent_connections;
+
+        graph_builder.build(graphs, input_edges, output_edges,
+                            parent_connections);
+
+        // build coordinators (graphs)
+        for (unsigned int i = 0; i < graphs.size(); ++i) {
+            ParallelCoordinator* coordinator = 0;
+            std::ostringstream ss;
+
+            ss << "S" << i;
+            coordinator =
+                new ParallelCoordinator(ss.str(),
+                                        paradevs::common::NoParameters(),
+                                        GraphParameters(graphs[i],
+                                                        input_edges[i],
+                                                        output_edges[i]));
+            _coordinators.push_back(coordinator);
+            ParallelHeapHierarchicalGraphManager < SchedulerHandle,
+                                                   GraphBuilder >::add_child(
+                                                       coordinator);
+
+        }
+
+        // builds internal connections (edges)
+        for (Connections::const_iterator it = parent_connections.begin();
+             it != parent_connections.end(); ++it) {
+            const Connection& connection = *it;
+            std::ostringstream ss_out;
+            std::ostringstream ss_in;
+
+            ss_out << "out_" << connection.first.second;
+            ss_in << "in_" << connection.first.second;
+
+            if (not ParallelHeapHierarchicalGraphManager <
+                    SchedulerHandle, GraphBuilder >::exist_link(
+                        _coordinators[connection.first.first - 1],
+                        ss_out.str(),
+                        _coordinators[connection.second.first - 1],
+                        ss_in.str())) {
+                ParallelHeapHierarchicalGraphManager <
+                    SchedulerHandle, GraphBuilder >::add_link(
+                        _coordinators[connection.first.first - 1],
+                        ss_out.str(),
+                        _coordinators[connection.second.first - 1],
+                        ss_in.str());
+            }
+        }
+    }
+
+    virtual ~ParallelHeapHierarchicalGraphManager()
+    {
+        for (typename Coordinators::const_iterator it = _coordinators.begin();
+             it != _coordinators.end(); ++it) {
+            delete *it;
+        }
+    }
+
+    void init()
+    {
+        for (typename Coordinators::const_iterator it = _coordinators.begin();
+             it != _coordinators.end(); ++it) {
+            (*it)->set_sender(
+                dynamic_cast < paradevs::pdevs::multithreading::Coordinator <
+                    common::DoubleTime,
+                    SchedulerType,
+                    SchedulerHandle,
+                    ParallelHeapHierarchicalGraphManager <
+                        SchedulerHandle,
+                        PartitioningGraphBuilder >,
+                    paradevs::common::NoParameters,
+                    PartitioningParameters >*
+                >(ParallelHeapHierarchicalGraphManager < SchedulerHandle,
+                                                         GraphBuilder >::
+                  get_coordinator())->get_sender());
+        }
+    }
+
+    void start(common::DoubleTime::type t)
+    {
+        for (typename Coordinators::const_iterator it = _coordinators.begin();
+             it != _coordinators.end(); ++it) {
+            (*it)->get_sender().send(
+                paradevs::pdevs::multithreading::start_message <
+                    paradevs::common::DoubleTime >(t));
+        }
+    }
+
+    void transition(const common::Models < common::DoubleTime,
+                    SchedulerHandle >& receivers,
+                    paradevs::common::DoubleTime::type t)
+    {
+        typename Coordinators::const_iterator it = _coordinators.begin();
+        bool found = false;
+
+        while (not found) {
+            if (std::find(receivers.begin(), receivers.end(),
+                          *it) != receivers.end()) {
+                (*it)->get_sender().send(
+                    paradevs::pdevs::multithreading::transition_message <
+                        paradevs::common::DoubleTime >(t));
+                found = true;
+            } else {
+                ++it;
+            }
+        }
+    }
+
+private:
+    typedef paradevs::pdevs::multithreading::Coordinator <
+    common::DoubleTime,
+    SchedulerType,
+    SchedulerHandle,
+    ParallelBuiltFlatGraphManager
+    < SchedulerHandle >,
+    common::NoParameters,
+    GraphParameters > ParallelCoordinator;
+
+    typedef std::vector < ParallelCoordinator* > Coordinators;
+
+    Coordinators _coordinators;
+};
+
+} } } // namespace paradevs tests boost_graph
+
+#endif

+ 171 - 0
src/tests/boost_graph/graph_partitioning.hpp

@@ -0,0 +1,171 @@
+/**
+ * @file tests/boost_graph/graph_partitioning.hpp
+ * @author The PARADEVS Development Team
+ * See the AUTHORS or Authors.txt file
+ */
+
+/*
+ * PARADEVS - the multimodeling and simulation environment
+ * This file is a part of the PARADEVS environment
+ *
+ * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
+ *
+ * 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/>.
+ */
+
+#ifndef __TESTS_BOOST_GRAPH_GRAPH_PARTITIONING_HPP
+#define __TESTS_BOOST_GRAPH_GRAPH_PARTITIONING_HPP 1
+
+#include <tests/boost_graph/graph_defs.hpp>
+#include <tests/boost_graph/partitioning/graph_build.hpp>
+#include <tests/boost_graph/partitioning/gggp.hpp>
+
+#include <boost/graph/copy.hpp>
+
+namespace paradevs { namespace tests { namespace boost_graph {
+
+class PartitioningGraphBuilder
+{
+public:
+    PartitioningGraphBuilder(int cn, std::string pmn, int cc, bool ccf) :
+        cluster_number(cn), partitioning_method_name(pmn),
+        contraction_coef(cc), contraction_coef_flag(ccf)
+    { }
+
+    void build(OrientedGraphs& graphs,
+               InputEdgeList& input_edges,
+               OutputEdgeList& output_edges,
+               Connections& parent_connections)
+    {
+        UnorientedGraph* g = new UnorientedGraph();
+        OrientedGraph go;
+        UnorientedGraph graph_origin;
+
+        // internal examples
+        // {
+        //     build_graph(*g, go);
+        //     boost::copy_graph(*g, graph_origin);
+        // }
+
+        // corsen examples
+        {
+            build_corsen_graph(go);
+            make_unoriented_graph(go, *g);
+            boost::copy_graph(*g, graph_origin);
+        }
+
+        Edges edge_partie;
+        Connections connections;
+
+        output_edges = OutputEdgeList(cluster_number);
+
+        if (contraction_coef_flag) {
+            graphs = Multiniveau(num_vertices(*g) / contraction_coef,
+                                 g, &graph_origin, &go,
+                                 cluster_number, "HEM",
+                                 partitioning_method_name,
+                                 "cut_norm", "norm", edge_partie ,
+                                 output_edges, input_edges,
+                                 parent_connections);
+        } else {
+            graphs = Multiniveau(contraction_coef, g, &graph_origin, &go,
+                                 cluster_number, "HEM",
+                                 partitioning_method_name,
+                                 "cut_norm", "norm", edge_partie ,
+                                 output_edges, input_edges,
+                                 parent_connections);
+        }
+
+        // std::cout << "*********************************" << std::endl;
+        // std::cout << "Graphs:" << std::endl;
+        // for (unsigned int i = 0; i < graphs.size(); ++i) {
+        //     std::cout << "graph[" << i << "]:" << std::endl;
+        //     const OrientedGraph& og = graphs[i];
+        //     OrientedGraph::vertex_iterator it_og, end_og;
+
+        //     tie(it_og, end_og) = vertices(og);
+        //     for (; it_og != end_og; ++it_og) {
+        //         OrientedGraph::adjacency_iterator neighbour_it, neighbour_end;
+
+        //         std::cout << og[*it_og]._index << " -> { ";
+        //         tie(neighbour_it, neighbour_end) = adjacent_vertices(*it_og,
+        //                                                              og);
+        //         for (; neighbour_it != neighbour_end; ++neighbour_it) {
+        //             std::cout << og[*neighbour_it]._index << " ";
+        //         }
+        //         std::cout << "}" << std::endl;
+        //     }
+        // }
+        // {
+        //     unsigned int i = 0;
+
+        //     std::cout << "Input edges:" << std::endl;
+        //     for (InputEdgeList::const_iterator it = input_edges.begin();
+        //          it != input_edges.end(); ++it, ++i) {
+        //         std::cout << "S" << i << " = {";
+        //         for (InputEdges::const_iterator it2 = it->begin();
+        //              it2 != it->end(); ++it2) {
+        //             std::cout << " ( " << it2->first << " -> " << it2->second
+        //                       << " )";
+        //         }
+        //         std::cout << " }" << std::endl;;
+        //     }
+        // }
+        // {
+        //     unsigned int i = 0;
+
+        //     std::cout << "Output edges:" << std::endl;
+        //     for (OutputEdgeList::const_iterator it = output_edges.begin();
+        //          it != output_edges.end(); ++it, ++i) {
+        //         std::cout << "S" << i << " = {";
+        //         for (OutputEdges::const_iterator it2 = it->begin();
+        //              it2 != it->end(); ++it2) {
+        //             std::cout << " ( " << it2->first << " -> " << it2->second
+        //                       << " )";
+        //         }
+        //         std::cout << " }" << std::endl;;
+        //     }
+        // }
+
+        // std::cout << "*********************************" << std::endl;
+
+    }
+
+private:
+    int cluster_number;
+    std::string partitioning_method_name;
+    int contraction_coef;
+    bool contraction_coef_flag;
+};
+
+class CorsenFlatGraphBuilder
+{
+public:
+    CorsenFlatGraphBuilder()
+    { }
+
+    void build(OrientedGraphs& graphs, InputEdgeList& /* input_edges */,
+               OutputEdgeList& /* output_edges */,
+               Connections& /* parent_connections */)
+    {
+        OrientedGraph graph;
+
+        build_corsen_graph(graph);
+        graphs.push_back(graph);
+    }
+};
+
+} } } // namespace paradevs tests boost_graph
+
+#endif

+ 207 - 0
src/tests/boost_graph/models.hpp

@@ -0,0 +1,207 @@
+/**
+ * @file tests/boost_graph/models.hpp
+ * @author The PARADEVS Development Team
+ * See the AUTHORS or Authors.txt file
+ */
+
+/*
+ * PARADEVS - the multimodeling and simulation environment
+ * This file is a part of the PARADEVS environment
+ *
+ * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
+ *
+ * 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/>.
+ */
+
+#ifndef TESTS_BOOST_GRAPH_MODELS_HPP
+#define TESTS_BOOST_GRAPH_MODELS_HPP 1
+
+#include <paradevs/common/time/DoubleTime.hpp>
+#include <paradevs/kernel/pdevs/Dynamics.hpp>
+
+namespace paradevs { namespace tests { namespace boost_graph {
+
+struct TopPixelParameters
+{ };
+
+template < class SchedulerHandle>
+class TopPixel :
+    public paradevs::pdevs::Dynamics < common::DoubleTime, SchedulerHandle,
+                                       TopPixelParameters >
+{
+public:
+    TopPixel(const std::string& name,
+             const TopPixelParameters& parameters) :
+        paradevs::pdevs::Dynamics < common::DoubleTime, SchedulerHandle,
+                                    TopPixelParameters >(name, parameters)
+    { }
+
+    virtual ~TopPixel()
+    { }
+
+    virtual void dint(typename common::DoubleTime::type /* t */)
+    {
+
+        // std::cout << TopPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": dint" << std::endl;
+
+    }
+
+    virtual typename common::DoubleTime::type start(
+        typename common::DoubleTime::type /* t */)
+    { return 0; }
+
+    virtual typename common::DoubleTime::type ta(
+        typename common::DoubleTime::type /* t */) const
+    { return 1; }
+
+    virtual common::Bag < common::DoubleTime, SchedulerHandle > lambda(
+        typename common::DoubleTime::type /* t */) const
+    {
+
+        // std::cout << TopPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": lambda" << std::endl;
+
+        common::Bag < common::DoubleTime, SchedulerHandle > bag;
+
+        bag.push_back(common::ExternalEvent < common::DoubleTime,
+                                              SchedulerHandle >("out", 0.));
+        return bag;
+    }
+};
+
+struct NormalPixelParameters
+{
+    NormalPixelParameters(unsigned int n) : _neighbour_number(n)
+    { }
+
+    unsigned int _neighbour_number;
+};
+
+template < class SchedulerHandle>
+class NormalPixel :
+    public paradevs::pdevs::Dynamics < common::DoubleTime, SchedulerHandle,
+                                       NormalPixelParameters >
+{
+public:
+    NormalPixel(const std::string& name,
+             const NormalPixelParameters& parameters) :
+        paradevs::pdevs::Dynamics < common::DoubleTime, SchedulerHandle,
+                                    NormalPixelParameters >(name, parameters),
+        _neighbour_number(parameters._neighbour_number)
+    { }
+
+    virtual ~NormalPixel()
+    { }
+
+    virtual void dint(typename common::DoubleTime::type t)
+    {
+
+        // std::cout << NormalPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": dint" << std::endl;
+
+        if (_phase == SEND) {
+            _phase = WAIT;
+            _received = 0;
+            _last_time = t;
+        }
+    }
+
+    virtual void dext(typename common::DoubleTime::type t,
+                      typename common::DoubleTime::type /* e */,
+                      const common::Bag < common::DoubleTime,
+                                          SchedulerHandle >& bag)
+    {
+
+        // std::cout << NormalPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": dext -> "
+        //           << bag.to_string() << std::endl;
+
+        for (typename common::Bag < common::DoubleTime,
+                                    SchedulerHandle >::const_iterator it =
+                 bag.begin(); it != bag.end(); ++it) {
+            if (it->on_port("in")) {
+                if (_last_time == t) {
+                    std::cout << "oups !" << std::endl;
+                }
+                ++_received;
+                if (_received == _neighbour_number) {
+                    _phase = SEND;
+                }
+            }
+        }
+
+        // std::cout << NormalPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": dext -> "
+        //           << _received << "/" << _neighbour_number
+        //           << std::endl;
+
+    }
+
+    virtual typename common::DoubleTime::type start(
+        typename common::DoubleTime::type /* t */)
+    {
+
+        // std::cout << NormalPixel < SchedulerHandle >::get_name()
+        //           << " = " <<_neighbour_number << std::endl;
+
+        _phase = WAIT;
+        _received = 0;
+        _last_time = common::DoubleTime::negative_infinity;
+        return common::DoubleTime::infinity;
+    }
+
+    virtual typename common::DoubleTime::type ta(
+        typename common::DoubleTime::type /* t */) const
+    {
+
+        // std::cout << NormalPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": ta" << std::endl;
+
+        if (_phase == WAIT) {
+            return common::DoubleTime::infinity;
+        } else {
+            return 0;
+        }
+    }
+
+    virtual common::Bag < common::DoubleTime, SchedulerHandle > lambda(
+        typename common::DoubleTime::type /* t */) const
+    {
+
+        // std::cout << NormalPixel < SchedulerHandle >::get_name() << " at "
+        //           << t << ": lambda" << std::endl;
+
+        common::Bag < common::DoubleTime, SchedulerHandle > bag;
+
+        if (_phase == SEND) {
+            bag.push_back(common::ExternalEvent < common::DoubleTime,
+                                                  SchedulerHandle >("out", 0.));
+        }
+        return bag;
+    }
+
+private:
+    enum Phase { WAIT, SEND };
+
+    unsigned int _neighbour_number;
+
+    Phase                             _phase;
+    unsigned int                      _received;
+    typename common::DoubleTime::type _last_time;
+};
+
+} } } // namespace paradevs tests boost_graph
+
+#endif

+ 30 - 0
src/tests/boost_graph/partitioning/CMakeLists.txt

@@ -0,0 +1,30 @@
+INCLUDE_DIRECTORIES(
+  ${CMAKE_SOURCE_DIR}/src
+  ${PARADEVS_INCLUDE_DIRS}
+  ${Boost_INCLUDE_DIRS}
+  ${GLIBMM_INCLUDE_DIRS}
+  ${LIBXML_INCLUDE_DIRS})
+
+LINK_DIRECTORIES(
+  ${GLIBMM_LIBRARY_DIRS}
+  ${LIBXML_LIBRARY_DIR})
+
+SET(PARTITIONING_HPP utils.hpp gggp.hpp graph_build.hpp)
+
+SET(PARTITIONING_CPP utils.cpp gggp.cpp graph_build.cpp)
+
+ADD_LIBRARY(partitioning SHARED ${PARTITIONING_HPP};${PARTITIONING_CPP})
+
+TARGET_LINK_LIBRARIES(partitioning corsen
+  ${Boost_LIBRARIES}
+  ${GLIBMM_LIBRARIES}
+  ${LIBXML_LIBRARIES}
+  ${GTHREAD_LIBRARIES})
+
+ADD_EXECUTABLE(partitioning-tests main.cpp)
+
+TARGET_LINK_LIBRARIES(partitioning-tests partitioning
+  ${Boost_LIBRARIES}
+  ${GLIBMM_LIBRARIES}
+  ${LIBXML_LIBRARIES}
+  ${GTHREAD_LIBRARIES})

+ 71 - 0
src/tests/boost_graph/partitioning/defs.hpp

@@ -0,0 +1,71 @@
+/**
+ * @file tests/boost_graph/partitioning/defs.hpp
+ * @author The PARADEVS Development Team
+ * See the AUTHORS or Authors.txt file
+ */
+
+/*
+ * PARADEVS - the multimodeling and simulation environment
+ * This file is a part of the PARADEVS environment
+ *
+ * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
+ *
+ * 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/>.
+ */
+
+#ifndef TESTS_BOOST_GRAPH_PARTITIONING_DEFS_H
+#define TESTS_BOOST_GRAPH_PARTITIONING_DEFS_H 1
+
+#include <list>
+#include <vector>
+
+#include <boost/graph/adjacency_list.hpp>
+
+#include <tests/boost_graph/graph_defs.hpp>
+
+namespace paradevs { namespace tests { namespace boost_graph {
+
+typedef unsigned int uint;
+
+typedef std::vector < int > Entiers;
+
+typedef std::vector < Entiers* > EntiersEntiers;
+typedef std::vector < EntiersEntiers > EntiersEntiersEntiers;
+typedef std::list < int > List;
+typedef std::list < EntiersEntiers* > ListEntiersEntiers;
+
+typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS,
+                                VertexProperties,
+                                EdgeProperties> UnorientedGraph;
+
+typedef std::vector < UnorientedGraph* > Base_Graph;
+