Skip to content

Implementation of Djikstra's Algorithm to find shortest path between 2 nodes in a graph.

Notifications You must be signed in to change notification settings

pingyash/djikstra

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Djikstra
========

Implementation of Djikstra's Algorithm to find shortest path between 2 nodes in a graph.

Input
=====
On stdin:
No. of vertices (N)
2D int Adjacency matrix
Start Node 0<sn<N+1
End Node   0<en<N+1

Output
======
On stdout
path
length

About

Implementation of Djikstra's Algorithm to find shortest path between 2 nodes in a graph.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published