03 June 2026 11:33:56 AM

tsp_greedy_test():
  C version
  Test tsp_greedy().

tsp_greedy():
  For the traveling salesperson problem, find a greedy
  solution by choosing a starting city, and then constructing
  the tour by always moving to the nearest unvisited city.
  Route starting at city 0 has cost = 23
  Route starting at city 1 has cost = 21

  The best greedy itinerary found:

  Step  From  To        Distance

     0     1   0               3
     1     0   3               2
     2     3   2               5
     3     2   4               8
     4     4   1               3
  ----    --  --  --------------
  cost:                       21

tsp_greedy():
  For the traveling salesperson problem, find a greedy
  solution by choosing a starting city, and then constructing
  the tour by always moving to the nearest unvisited city.
  Route starting at city 0 has cost = 234
  Route starting at city 1 has cost = 138
  Route starting at city 4 has cost = 50

  The best greedy itinerary found:

  Step  From  To        Distance

     0     4   7               1
     1     7   6               1
     2     6   0               7
     3     0   1               4
     4     1   2               9
     5     2   3               6
     6     3   5               5
     7     5   8              12
     8     8   4               5
  ----    --  --  --------------
  cost:                       50

tsp_greedy_test():
  Normal end of execution.

03 June 2026 11:33:56 AM