- 07/13/2019 at 12:55 am #1431041EduGorillaKeymasterSelect Question Language :
Consider the following statements regarding Dijsktra’s shortest path algorithm :
S1 : Dijkstra’s Algorithm can be implemented on both directed and undirected graphs.
S2 : Dijkstra Algorithm provides shortest distance from every node to every other node.
S3 : Dijsktra Algorithm just provide the shortest distance , it doesn’t provide the path information.
Which of the above statements are correct ?
Post your Training /Course EnquiryAre You looking institutes / coaching center for
- S2 and S3
- S1 and S3
- Only S1
- S1, S2 and S3
- IIT-JEE, NEET, CAT
- Bank PO, SSC, Railways
- Study Abroad