Skip to content

Karp's 21st problem, called the Maximum Cut Problem, implemented into Java

Notifications You must be signed in to change notification settings

alyssarose05/Karp21MaxCut

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

HOW TO DOWNLOAD AND RUN:

  1. Download the Karp21MaxCut.jar file in the "Releases" section of this repository.
  2. Put your input file in the same location as the .jar file.
  3. Open your terminal in that location and type this command: java -jar Karp21MaxCut.jar -inputFile [input file] -outputFile [output file] -size [size]

About the running command:

  • Sample input files: Small_Input.txt, Medium_Input.txt, Large_Input.txt (input.txt by default)
  • The output file is output.txt by default.
  • Available sizes: small (at least 10), medium (at least 15), large (at least 20)

ADDITIONAL FLAGS:

  • -bruteForce: Solve using brute force.

  • -mathRandom: Solve using Math.random().

  • -bbs: Solve using the Blum-Blum-Shub (BBS) algorithm.

  • -max_gen <number>: The maximum number of generations you want to stop at (100 by default)

  • -max_sol <number>: The maximum number of correct solutions you want to stop at (10000 by default)

  • -max_fitness <number>: The maximum fitness you want to stop at (1 by default)

Use --h or --help for more help on flags.

About

Karp's 21st problem, called the Maximum Cut Problem, implemented into Java

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages