RosettaCodeData/Task/Dijkstras-algorithm/Uiua/dijkstras-algorithm.uiua

8 lines
305 B
Plaintext

# Experimental!
# Use table of edge weights.
A ← [[0 7 9 0 0 14] [0 0 10 15 0 0] [0 0 0 11 0 2]
[0 0 0 0 6 0] [0 0 0 0 0 9][0 0 0 0 0 0]]
Ns ← ⍜⊟⍜⍉(▽⊸≡(≠0⊢)):°⊏⊡:A # Neighbours with costs.
P ← &p$"Path: _ with cost _"/$"_->_"+@a°□⊢astar(Ns|0|≍)°⊟
≡P[0_4 0_5]