day-15.rb
# Literally never better than dijkstra in our case
Literally never better than dijkstra in our case
Literally never better than dijkstra in our case
def bellman_ford_solution(graph)
    goal = goal(graph)
    solution = Algorithms::bellman_ford([0,0], graph)
    solution[:distances][goal]
  end
def bellman_ford_solution ( graph ) goal = goal ( graph ) solution = Algorithms :: bellman_ford ( [ 0 , 0 ] , graph ) solution [ :distances ] [ goal ] end
Literally never better than dijkstra in our case
Literally never better than dijkstra in our case
graph
<not_specific>