k-BSP

Solves k-bottleneck Steiner problem using multi-swarm optimization.

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
MSTheuristic.cpp		MSTheuristic.cpp
MSTheuristic.h		MSTheuristic.h
README.md		README.md
crtanje_rojeva.cpp		crtanje_rojeva.cpp
disjointSet.cpp		disjointSet.cpp
disjointSet.h		disjointSet.h
edge.cpp		edge.cpp
edge.h		edge.h
jedna_instanca_i_crtanje.cpp		jedna_instanca_i_crtanje.cpp
kruskal.cpp		kruskal.cpp
kruskal.h		kruskal.h
line.cpp		line.cpp
line.h		line.h
main.cpp		main.cpp
minimalSpanningTree.cpp		minimalSpanningTree.cpp
minimalSpanningTree.h		minimalSpanningTree.h
multiswarm.cpp		multiswarm.cpp
multiswarm.h		multiswarm.h
node.cpp		node.cpp
node.h		node.h
particle.cpp		particle.cpp
particle.h		particle.h
steinerTree.cpp		steinerTree.cpp
steinerTree.h		steinerTree.h
swarm.cpp		swarm.cpp
swarm.h		swarm.h
testiranje.cpp		testiranje.cpp
usableEdges.cpp		usableEdges.cpp
usableEdges.h		usableEdges.h

Provide feedback