• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Dijkstra’S Algorithm
 

Dijkstra’S Algorithm

on

  • 5,961 views

Method used by ArcGIS Network Analysis

Method used by ArcGIS Network Analysis

Statistics

Views

Total Views
5,961
Views on SlideShare
5,960
Embed Views
1

Actions

Likes
4
Downloads
161
Comments
1

1 Embed 1

http://www.linkedin.com 1

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

11 of 1 previous next

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
  • i realy appreciate slideshare. this is ridiculus
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Dijkstra’S Algorithm Dijkstra’S Algorithm Presentation Transcript

    • DIJKSTRA’s ALGORITHM
      Dijkstra_Algorithm
      AmanArora
      Geographical Analyst
      Lepton Software
      Mail Id: aman.arora@leptonmaps.com
      aman.july07@gmail.com
    • Introduction
      Dijkstra's Algorithm derived by a Dutch computer scientist ‘EdsgerDijkstra’ in 1956 and published in 1959.
      It’s a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree.
      This algorithm is often used in routing and as a subroutine in other graph algorithms.
    • How it works ?
      This algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.
      According to this algorithm, to solve a given problem, we need to solve different parts of problems.
    • Numerical Algorithm
      Formulae
      O(|V|²+|E|) = O(|V|²)
      Where,
      E= Edges, V= Vertices
      |E| = Function of Edges
      |V| = Function of Vertices and
      O = Constant
    • Graph Algorithm
      In this interconnected ‘Vertex’ we’ll use ‘Dijkstra’s Algorithm’.
      To use this algorithm in this network we have to start from a decided vertex and then continue to others.
    • Graph Algorithm
      So, for the calculation give infinite value to all Vertex.
      And start with ‘A’ using this table:
    • Graph Algorithm
    • Graph Algorithm
    • Graph Algorithm
    • Graph Algorithm
    • Graph Algorithm
    • Graph Algorithm
    • Graph Algorithm
    • Graph Algorithm
      So with this ‘Graph Algorithm’ we found our best lowest cost route in this interconnected Vertex.
      And the best lowest cost path is given below:
      A B F C D (H) G
      So total cost from ‘A’ to ‘G’ vertex is ‘70’ which is lowest cost from other Vertex.
    • What is the analysis technique using this Algorithm in ArcGIS Network Analysis?
      From this demonstration now we know about method used by this algorithm to find out lowest cost route.
      Exactly this technique is adapted by ArcGIS NA and it uses to find out solution of any network problem.
      Where we use Vertex to reach our destination, in ArcGIS NA we use junctions as Vertex to find out lowest cost route, New Service area, closest facility etc.