Dijkstra's Algorithm: Finding the Shortest Path

Поділитися
Вставка
  • Опубліковано 24 гру 2024

КОМЕНТАРІ • 3

  • @coreyspeedmode9287
    @coreyspeedmode9287 Рік тому

    really good video! the visualizations were helpful

    • @deepbean
      @deepbean  Рік тому +1

      I'm glad you enjoyed it!!

  • @webdozor
    @webdozor 5 місяців тому

    Great explanation. Thank you. Are you familiar with any algorithms for solving the following task: lets say we have an empty battery with infinite capacity that is beeing charged at W Watts/Hour, and B number of buttons, each button uses X amount of stored energy, but increases the charging rate by Y Watts/Hour. Each button can be pressed only once. We need to fin the sequence that will allow us reach maximum charging rate (aka press all the buttons) in the shortest time.