Add problem definition Dijkstra's shortest path algorithm

[RajNilkar]

No description provided.

[wrigjl]

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.

[RajNilkar]

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

[wrigjl]

When creating a skeleton problem, several classes must be present, even if they have "dummy" implementation.

Have a look at: https://github.com/ReduxISU/Redux/tree/CSharpAPI/ProblemTemplate/Templates

You'll find the skeleton classes that must be present. At minimum you need a Solver, Verifier, Visualization

Also, we've switched to .NET10, so you'll likely want to pull our current CSharpAPI branch into your development branch.