diff options
author | Marcin Chrzanowski <marcin.j.chrzanowski@gmail.com> | 2017-02-11 11:04:44 +0100 |
---|---|---|
committer | Marcin Chrzanowski <marcin.j.chrzanowski@gmail.com> | 2017-02-11 11:04:44 +0100 |
commit | 8233269c1c34bcaa38237ddac73ca8b074dc764a (patch) | |
tree | ebe9c1eb08fab154fbad305568b7e467ce1bd804 | |
parent | 7285cb9105faa4981d28ab6a936deb517438b0f9 (diff) |
Update README
-rw-r--r-- | README.md | 31 |
1 files changed, 30 insertions, 1 deletions
@@ -1,8 +1,37 @@ # Brandes's Algorithm -## Running +## Building mkdir build cd build cmake .. make + +## Running + + ./brandes <number threads> <input file> <output file> + +### Graph representation + +This implementation expects a simple, directed, unweighted graph with vertices +labeled with integers. + +Sample input file: + + 0 2 + 2 0 + 2 3 + 2 4 + 3 2 + 3 5 + 3 6 + +Here each line represents a directed edge from the first node to the second. + +The output will contain a line for each node with at least one out edge, of the +form `<node> <BC[node]>`. Thus for the above sample input, the output file +should contain: + + 0 0 + 2 6 + 3 4 |