Golang实现Dijkstra算法过程详解

package main
import (
	"fmt"
	"math"
)
// Dijkstra 算法用于计算无向图的最短路径
func dijkstra(graph [][]int, startNode int) []int {
	// 获取节点数
	nodesCount := len(graph)
	// 初始化 visited 和 distance 数组
	visited := make([]bool, nodesCount)
	distance := make([]int, nodesCount)
	for i := 0; i < nodesCount; i++ {
		visited[i] = false
		distance[i] = math.MaxInt32 // 赋初值为最大值
	}
	// 起始节点到自身的距离为 0
	distance[startNode] = 0
	// 计算从起始节点到所有其他节点的最短距离
	for i := 0; i < nodesCount-1; i++ {
		minDistance := math.MaxInt32 // 最短距离的初始值为最大值
		currentNode := -1
		// 找到距离起始节点最近的未访问节点
		for j := 0; j < nodesCount; j++ {
			if !visited[j] && distance[j] < minDistance {
				minDistance = distance[j]
				currentNode = j
			}
		}
		// 如果没有找到最近的未访问节点，则退出循环
		if currentNode == -1 {
			break
		}
		// 标记当前节点为已访问
		visited[currentNode] = true
		// 更新起始节点到其他节点的距离
		for j := 0; j < nodesCount; j++ {
			if graph[currentNode][j] != -1 {
				newDistance := distance[currentNode] + graph[currentNode][j]
				if newDistance < distance[j] {
					distance[j] = newDistance
				}
			}
		}
	}
	return distance
}
func main() {
	// 初始化无向图
	graph := [][]int{
		{-1, 2, -1, 6, -1},
		{2, -1, 3, 8, 5},
		{-1, 3, -1, -1, 7},
		{6, 8, -1, -1, 9},
		{-1, 5, 7, 9, -1},
	}
	startNode := 0 // 起始节点为 0
	distances := dijkstra(graph, startNode)
	// 输出起始节点到其他节点的最短距离
	fmt.Println("Shortest distances from node", startNode, "to all other nodes:")
	for i, d := range distances {
		fmt.Printf("Node %d: %d\n", i, d)
	}
}