• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Implementation of shortest path algorithm in a given
 

Implementation of shortest path algorithm in a given

on

  • 1,074 views

 

Statistics

Views

Total Views
1,074
Views on SlideShare
1,074
Embed Views
0

Actions

Likes
0
Downloads
14
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Implementation of shortest path algorithm in a given Implementation of shortest path algorithm in a given Presentation Transcript

    • IMPLEMENTATION OF SHORTEST PATHALGORITHM IN A GIVEN MAZE AND STUDYINGTHE ALGORITHM’S TIME AND SPACECOMPLEXITY By- Abhas Vyas Guide- Prof. G.R Brindha
    • THE SEARCH SPACE We have implemented an algorithm for finding the shortest path avoiding obstacles and dis- continuity in a search space which is a single source single destination type. The initial point is in red and the final point is in green.
    • THE APPROACH The approach includes feature extraction from an image of the search space i.e. lines, nodes and obstacles. Thereafter, finding the adjacency matrix of each node based on Euclidean distance and pixel information of the path between the nodes. The graph created for the implementation is labeled and is of variable branching factor and for which an average branching factor is calculated.
    •  An optimum path is produced by minimizing the cost function taking into account the catenated matrix of the nodes and path connecting them. The optimum path is obtained by applying Breadth-first Search, Depth-first Search and A* algorithm and their time and space complexity are compared.
    • A FLOWCHART FOR MAKING A CATENATED MATRIXOF NODES
    • A FLOWCHART FOR MAKING THE ADJACENCYMATRIX
    • SAMPLE SEARCH SPACES WITH ASSOCIATEDOPTIMUM PATH FROM SOURCE Figure 1
    • Figure 2 Figure 3
    • GRAPH DEPICTING VARIATION OF COMPUTATIONTIME FOR BFS SEARCH WITH DEPTH OF GOAL NODE
    • GRAPH DEPICTING VARIATION OF COMPUTATIONTIME FOR DFS SEARCH WITH DEPTH OF GOAL NODE
    • THANK YOU!