go中的递归旅行商式计算

package main

import (
	"fmt"
	"math"
)

func tsp(graph [][]float64, visited []bool, currentCity, n, count int, cost, minCost float64, path []int) {
	if count == n && graph[currentCity][0] > 0 {
		minCost = math.Min(minCost, cost+graph[currentCity][0])
		copy(path, append(path, currentCity))
		fmt.Printf("最短路径: %v\n", path)
		fmt.Printf("最短路径长度: %.2f\n", minCost)
		return
	}

	for i := 0; i < n; i++ {
		if !visited[i] && graph[currentCity][i] > 0 {
			visited[i] = true
			path = append(path, currentCity)
			tsp(graph, visited, i, n, count+1, cost+graph[currentCity][i], minCost, path)
			visited[i] = false
			path = path[:len(path)-1]
		}
	}
}

func main() {
	graph := [][]float64{
		{0, 10, 15, 20},
		{10, 0, 35, 25},
		{15, 35, 0, 30},
		{20, 25, 30, 0},
	}
	n := len(graph)
	visited := make([]bool, n)
	visited[0] = true
	path := make([]int, 0, n)
	minCost := math.MaxFloat64

	tsp(graph, visited, 0, n, 1, 0, minCost, path)
}