Dijkstra's Algorithm is a greedy algorithm used to find the shortest path from a starting node to all other nodes in a graph. The graph can have non-negative weights on its edges, and the algorithm ...
A school project for learning Java, where I created a maze-solving game using Dijkstra's algorithm. This is my very first Java project, with a basic UI—nothing fancy, but it works! You can create a ...
I recently solved LeetCode problem #778 “Swim in Rising Water”, where the goal is to return the least time required to traverse an N×N elevation grid under rising-water constraints. I implemented a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results