Toggle navigation
Egison
Documentations
Try It Out
Online Tools
Online Egison Interpreter
Online Egison Tutorial
Online Demonstrations
Poker Hands
Mahjong
Prime Numbers
Trees
Graph (Bellman-Ford Algorithm)
Randomized 3-SAT
Time-Series Data
Math
Blog
Community
Bellman-Ford Algorithm
You can edit and run the following code. Enjoy Egison programming!
-- initiate a distance graph def A := [|[|0, 19, 36, 66, 99, 65|] , [|19, 0, 25, 59, 64, 31|] , [|36, 25, 0, 84, 48, 28|] , [|66, 59, 84, 0, 59, 29|] , [|99, 64, 48, 59, 0, 9|] , [|65, 31, 28, 29, 9, 0|]|] def G.* t1 t2 := withSymbols [i] reduce min (contract (t1~#_i + t2~i_#)) match iterate (\P -> G.* P A) A as list something with | _ ++ $P :: #P :: _ -> P -- [|[| 0, 19, 36, 66, 59, 50 |] -- [| 19, 0, 25, 59, 40, 31 |] -- [| 36, 25, 0, 57, 37, 28 |] -- [| 66, 59, 57, 0, 38, 29 |] -- [| 59, 40, 37, 38, 0, 9 |] -- [| 50, 31, 28, 29, 9, 0 |]|]
Run
What to do next...
Next Demonstration
Back to Home
This website in other langauge:
English
,
日本語