shortest_path_weighted_graph.rb

def weighted_graphs(matrix)
  # write your code here
  weighted_hash_graph = adjacency_list(matrix)
  min_station_stops = Array.new(matrix.size, 0)
  queue = [0]
  visited = [0]

  until queue.empty?
    current_node = queue.shift
    weighted_hash_graph[current_node].each do|vertex|
      unless visited.include?(vertex)
          visited << vertex &&  queue << vertex
          min_station_stops[vertex] += get_count_station_stops(weighted_hash_graph[vertex], 0)
      end
    end
  end
  min_station_stops
end

def adjacency_list(matrix)
  hash_graph =  Hash.new
  stop = matrix.size - 1
  0.upto(stop) do |row|
    hash_graph[row] = []
    0.upto(stop) do |column|
      hash_graph[row] << column unless matrix[row][column].zero?
    end
  end
  hash_graph
end

def get_count_station_stops(arr_connected_nodes, start_node)
  unless arr_connected_nodes.include?(start_node)
    return 2
  end
  return 1
end

def shortest_distance(hash_graph)
  fixed_edge_distance = 6
  
end

p weighted_graphs([[0, 0, 1, 3, 0, 0], [0, 0, 0, 5, 0, 0], [1, 0, 0, 2, 1, 4], [3, 5, 2, 0, 7, 0], [0, 0, 1, 7, 0, 2], [0, 0, 4, 0, 2, 0]])
# => [0, 2, 1, 1, 2, 2]
p weighted_graphs([[0, 3, 6, 0, 0, 9, 4], [3, 0, 4, 1, 0, 0, 0], [6, 4, 0, 3, 5, 4, 1], [0, 1, 3, 0, 2, 0, 0], [0, 0, 5, 2, 0, 3, 0], [9, 0, 4, 0, 3, 0, 3], [4, 0, 1, 0, 0, 3, 0]])
# => [0, 1, 1, 2, 2, 1, 1]
# p weighted_graphs([[0, 3, 6, 0, 0, 9, 4], [3, 0, 4, 1, 0, 0, 0], [6, 4, 0, 3, 5, 4, 1], [0, 1, 3, 0, 2, 0, 0], [0, 0, 5, 2, 0, 3, 0], [9, 0, 4, 0, 3, 0, 3], [4, 0, 1, 0, 0, 3, 0]])
# => [0, 1, 1, 3, 2, 2, 3, 3, 4, 1]