densest-subgraph

File input type

For algorithms for unweighted graphs, the input graph file is required to be of the format:

n m
u1 v1
u2 v2
.
.
.
um vm

For algorithms for weighted graphs, the input graph file is required to be of the format:

n m
u1 v1 w1
u2 v2 w2
.
.
.
um vm wm

To compile all four versions of the code, i.e.,

simply run

sudo chmod +x compile_all.sh
./compile_all.sh

To run the code, the syntax goes as follows:

./exact multiplier < input_file

./exactweighted multiplier < input_file

./ip no_of_iterations < input_file

./ipnw no_of_iterations < input_file

Name		Name	Last commit message	Last commit date
Latest commit History 120 Commits
alternate_code		alternate_code
approxDSP-MWU		approxDSP-MWU
datasets		datasets
exactDSP-cpp		exactDSP-cpp
exactDSP-python		exactDSP-python
generators		generators
tests		tests
tools		tools
.gitignore		.gitignore
README.md		README.md
compile_all.sh		compile_all.sh
iterative_peeling.cpp		iterative_peeling.cpp
iterative_peeling_naive_weighted.cpp		iterative_peeling_naive_weighted.cpp