[Java] Dijkstra's Shortest Path Algorithm (Adjacency Matrix)

[sumitaccess007]

Implementation of Dijkastra's Shortest Path Algorithm in Java (Data Structure used is Adjacency Matrix)

Graph

• [x] Dijkstra's algorithm
• [ ] Edmonds–Karp algorithm
• [ ] Ford–Fulkerson algorithm
• [ ] Floyd–Warshall algorithm
• [ ] Tarjan's strongly connected components algorithm

[sumitaccess007]

Please remove the Fibonacci Search source file, as it is aleady merged from different PR.

Also fix the spelling of Dijkstra. 😛

Hi @amanmehara Thanks for the Review, I have removed Fibonacci Search and Corrected Dijkstra Spelling as well.

Thanks to review again.