How do I implement Dijkstra's algorithm in Swift?

Dijkstra's algorithm is a popular algorithm used for finding the shortest paths between nodes in a graph. This can be particularly useful in routing and navigation applications. Below is a simple implementation of Dijkstra's algorithm in Swift.


    import Foundation

    // Function to implement Dijkstra's algorithm
    func dijkstra(graph: [[Int]], source: Int) -> [Int] {
        let n = graph.count
        var distances = Array(repeating: Int.max, count: n)
        var visited = Array(repeating: false, count: n)
        distances[source] = 0
        
        for _ in 0.. Int {
        var minVal = Int.max
        var minIndex = 0
        for v in 0..