gggp.hpp 2.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  1. /**
  2. * @file tests/boost_graph/partitioning/gggp.hpp
  3. * @author The PARADEVS Development Team
  4. * See the AUTHORS or Authors.txt file
  5. */
  6. /*
  7. * PARADEVS - the multimodeling and simulation environment
  8. * This file is a part of the PARADEVS environment
  9. *
  10. * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
  11. *
  12. * This program is free software: you can redistribute it and/or modify
  13. * it under the terms of the GNU General Public License as published by
  14. * the Free Software Foundation, either version 3 of the License, or
  15. * (at your option) any later version.
  16. *
  17. * This program is distributed in the hope that it will be useful,
  18. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  19. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  20. * GNU General Public License for more details.
  21. *
  22. * You should have received a copy of the GNU General Public License
  23. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  24. */
  25. #ifndef TESTS_BOOST_GRAPH_PARTITIONING_GGGP_H
  26. #define TESTS_BOOST_GRAPH_PARTITIONING_GGGP_H 1
  27. #include <tests/boost_graph/partitioning/utils.hpp>
  28. namespace paradevs { namespace tests { namespace boost_graph {
  29. void ggp(UnorientedGraph *g, Entiers *sommetsSource,
  30. Entiers *sommetsDestination, EntiersEntiers &Partition);
  31. void gggp(UnorientedGraph *g, Entiers *sommetsSource,
  32. Entiers *sommetsDestination, EntiersEntiers &Partition);
  33. void gggp_pond(UnorientedGraph *g, Entiers *sommetsSource,
  34. Entiers *sommetsDestination, EntiersEntiers &Partition);
  35. void Iter_2l(EntiersEntiers &part, int nbr_parties, UnorientedGraph *g,
  36. const std::string &nom);
  37. void bissectionRec(UnorientedGraph *g, EntiersEntiers &Partition,
  38. int nbr_parties, const std::string &nom);
  39. void Pseudo_random_partitioning(UnorientedGraph *g, EntiersEntiers &Partition,
  40. uint nbr_parties);
  41. EntiersEntiers Random_partitioning(UnorientedGraph *g,
  42. uint nbr_parties);
  43. OrientedGraphs Multiniveau(uint niveau_contraction, UnorientedGraph *g, UnorientedGraph *graph_origin,
  44. OrientedGraph *go, int nbr_parties,
  45. std::string contraction,
  46. std::string type_methode,
  47. std::string choix_affinage,
  48. std::string type_cut,
  49. Edges &edge_partie,
  50. OutputEdgeList &outputedgeslist,
  51. InputEdgeList &inputedgelist,
  52. Connections &connections);
  53. } } } // namespace paradevs tests boost_graph
  54. #endif