Skip to content

Four algorithms solving the NP-Complete problem: Minimum Vertex Cover

Notifications You must be signed in to change notification settings

ChujieChen/Minimum-Vertex-Cover

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

96 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Minimum Vertex Cover

Java implementation of Gatech CSE6140 group project. All four algorithms are tested on Mac / Linux.

Compile

At the project root directory run:

javac $(find . -name "*.java")

Run MVC

Change directory to /src, then run java main.java.JavaAlgo -inst <filename> -alg [BnB|Approx|LS1|LS2] -time <cutoff in seconds> -seed <random seed>.

Note that with BnB, you still have to provide a -seed <random seed> even though the seed will not be used at all.

An example shows below:

cd src    # now at /path/to/project/src/
java main.java.JavaAlgo -inst jazz.graph -alg LS2 -time 600 -seed 9

About

Four algorithms solving the NP-Complete problem: Minimum Vertex Cover

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 91.1%
  • Python 8.9%