项目作者: DarkWingMcQuack

项目描述 :
Implementation of hypergraph partitioning using MinMax streaming
高级语言: C++
项目地址: git://github.com/DarkWingMcQuack/MMStreamer.git
创建时间: 2018-11-30T01:18:09Z
项目社区:https://github.com/DarkWingMcQuack/MMStreamer

开源协议:GNU General Public License v3.0

下载


License: GPL v3

MMStreamer

This is an implementation of a Hypergraph partitioner using MinMax Streaming as described in this paper.
Instead of balancing the partitions in terms of edges, this partitioner currently uses the nodes and the maximim unbalancing factor of the cut can be specified by a given parameter.

How to build

To build MMStreamer, make sure you have Boost, CMake and a C++17 compatible
compiler, such as clang or gcc installed.
Tested were GCC7.3 and Clang 7. Use one of those two to build without any issues.

Then run the following to build MMStreamer:

  1. git clone https://github.com/DarkWingMcQuack/MMStreamer
  2. cd MMStreamer
  3. mkdir build && cd build
  4. cmake ..
  5. make

To use Clang as compiler, run cmake -DUSE_CLANG=ON .. instead of cmake ...

How to Use

To start the partitioner, follow the commands provided in the main file. The following parameters can be set:

Parameter Effect
help,h display help message
raw,r if set, output is formatted in csv to make it easier to plot directly. If not set, the output is more verbose.
input,i input hypergraph file
partitions,p number of partitions
balancing,b a double between 0 and 1 which will be used as the maximum unbalancing constraint

Input Format

MMStreamer expects a file in the edgelist format.
In the edgelist format each line models a node followed by a comma
seperated list of edges it is connected to.
For example:

  1. 4: 1, 2, 3, 4, 5
  2. 2: 1
  3. 5: 3, 5, 7

This would be a hypergraph with node 4 connected to edges 1,2,3,4,5 and so on.