This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 2 years, 4 months ago.

  • Author
    Posts
  • #1431041 Reply
     EduGorilla 
    Keymaster
    Select 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 ?

    Options :-

    1. S2 and S3
    2. S1 and S3
    3. Only S1
    4. S1, S2 and S3
    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Consider the following statements regarding Dijsktra’s shortest path algorithm : S1 : Dijkstra’s Alg….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account