Man pages for caranha/EvoGCP
Evolutionary Computation Tools for the Graph Coloring Problem

abc.step1.kuiChange from regular ABC: For every individual, the...
abc.step2.kuiChange from regular ABC: For every individual, the...
adjacency_listAdjacency List
adjacent_color_setAuxiliar function for DSatur Given a set of colors of G,...
dsaturDSatur (doesn't color all vertices, doesn't generate...
euclidean_distanceEuclidean Distance
ffa.heuristical_swapHeuristical Swap (step2)
ffa.improveImprove (step2)
graph_culberson_equipartiteEquipartite Graph (+IID) Source:...
graph_culberson_flatGenerates a 3-GCP instance following the Culberson's Graph...
graph_culberson_variability3-Colorable with Variability Graph (+IID) Source:...
graph_mintonGenerates a 3-GCP instance following the algorithm described...
graph_randomGenerates a random, valid 3-GCP instance, without...
helloHello, World!
IID.edgesIID - Independent Random Edge Assignment Source:...
problemsetProblemset Generator
random_coloringRandom coloring generator
random_weightRandom weight generator
rlevyRandom Levy
similarity.kuiKui's similarity
solver_abcArtificial Bee Colony Solver (Togashi Version)
solver_abc_kuiArtificial Bee Colony Solver (Kui Version)
solver_cuckooCuckoo Search Solver (Toda Version)
solver_dsaturDSatur Solver
solver_ffaFirefly Solver (Fister Version)
solver_hdpsoHamming Distance PSO Solver
solver_randomRandom Solver
tester.batchTester Batch
caranha/EvoGCP documentation built on April 11, 2018, 11:52 p.m.