Skip to content

Add problem definition Dijkstra's shortest path algorithm#153

Open
RajNilkar wants to merge 3 commits intoReduxISU:CSharpAPIfrom
RajNilkar:CSharpAPI
Open

Add problem definition Dijkstra's shortest path algorithm#153
RajNilkar wants to merge 3 commits intoReduxISU:CSharpAPIfrom
RajNilkar:CSharpAPI

Conversation

@RajNilkar
Copy link

No description provided.

@wrigjl
Copy link
Collaborator

wrigjl commented Feb 5, 2026

We chatted briefly about this yesterday, but I wanted to capture the idea here. There's a subtlety we have to be careful with in Redux and that is the difference between a problem and an algorithm.

The problem is "shortest path" and one possible algorithm for solving it was created by Dijkstra. So, this is a case where were the problem and solution are different names. You'll need to revise this so that the problem is something like: NPC_SHORTESTPATH and your solver (when you write it) is for example DijkstraSolver.

For reference, there are several algorithms for solving this problem... check here:

  • Dijkstra's algorithm
  • Bellman-Ford
  • etc.

Shortest path is the problem, Dijkstra is one algorithm to solve it
@RajNilkar
Copy link
Author

Just made those changes, Professor Wright. Changed file path structure to include it as the SHORTESTPATH problem instead of DIJKSTRA.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants