Perplexity

Sub Dijkstra(graph As Map, startNode As String) As Map
    Dim distances As Map
    distances.Initialize
    For Each node In graph.Keys
        distances.Put(node, 1000000) 'set initial distance to infinity'
    Next
    distances.Put(startNode, 0) 'set distance to start node to zero'
   
    Dim visitedNodes As List
    visitedNodes.Initialize
   
    Dim currentNode As String = startNode
   
    Do While currentNode <> ""
        visitedNodes.Add(currentNode)
       
        For Each neighbor In graph.Get(currentNode)
            Dim tentativeDistance As Int = distances.Get(currentNode) + neighbor.Value
           
            If tentativeDistance < distances.Get(neighbor.Key) Then
                distances.Put(neighbor.Key, tentativeDistance)
            End If
        Next
       
        Dim smallestDistance As Int = 1000000 'initialize smallest distance to infinity'
        Dim nextNode As String = ""
       
        For Each node In graph.Keys
            If Not(visitedNodes.Contains(node)) And (distances.Get(node) < smallestDistance) Then
                smallestDistance = distances.Get(node)
                nextNode = node
            End If
        Next
       
        currentNode = nextNode
       
    Loop
   
    Return distances 'return the shortest path from the start node to all other nodes'
End Sub

'Example usage:'
Sub ExampleUsage()
   Dim graph As Map
 
   graph.Initialize
 
   graph.Put("A", CreateMap("B":2, "C":3))
   graph.Put("B", CreateMap("A":2, "C":1))
   graph.Put("C", CreateMap("A":3, "B":1))
 
   Log(Dijkstra(graph, "A"))
End Sub