Traveling Salesman requires floating point distances between edges so class Vertex was modified.As a consequence Bellman Ford and Dijkstra required few casts to int
new: Vertex.toString, TravelingSalesman.algorithm
nothing much
ignore all files that end in :~
remove tmp file
tsp
tsp
SCC
SCC again
SCC yet again
tsp computing correctly only for sorted vertices
tsp working for n < 11, dunno why
heuristic algorithm for tsp problem
cleanup
gitignore update