/COL380-Lab-2

Multi-level graph partitioning problem

Primary LanguageC++

COL380 Lab 2

Use random_graph.cpp to generate random networks for testing. Ensure high number of edges so there are no isolated vertices (connectedness not guaranteed).

bisect.cpp handles a) k = 2^r, b) Number of partitions <= Number of vertices (currently)