19 views

Uploaded by _Nishant_

- Dijkstra's Algorithm
- 10.1.1.131
- Energy Optimized Topologies for Distributed
- IJETT-V2I1P204
- 06 Advanced Centrality Concepts
- MS 4 Assigments Resit
- New Microsoft Office Word 97 - 2003 Document
- Bachelorarbeit - SLAM
- Duty-Cycle-Aware Minimum Latency Broadcast Scheduling in Clustered Multi-hop Wireless Networks
- 6689_01_rms_20130307.pdf
- Shortest Path
- Dynamic Programming
- Dijkstra's Shortest Path Algorithm
- se lec36
- A Greedy Scheme for Designing Delay Monitoring Systems of IP Networks
- hw3
- Zsuzsanna Dancso- On a universal finite type invariant of knotted trivalent graphs
- 10.1.1.64
- AbsA divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,2,...|V |} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then number of edges labeled with 0 and thenumber of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. In this paper we prove that helm Hn , flower graph Fln and Gear graph Gn are divisor cordial graphs. Moreover we show that switching of a vertex in cycle Cn , switching of a rim vertex in wheel Wn and switching of the apex vertex in helm Hn admit divisor cordial labeling.tract
- Report

You are on page 1of 23

http://www.cs.utexas.edu/~EWD/

- May 11, 1930 August 6, 2002 - Received the 1972 A. M. Turing Award, widely considered the most prestigious award in computer science.

- The Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000

- Made a strong case against use of the GOTO statement in programming languages and helped lead to its deprecation. - Known for his many essays on programming.

Single-Source Shortest Path Problem - The problem of finding shortest paths from a source vertex v to all other vertices in the graph.

DIJKSTRA'S ALGORITHM

Dijkstra's algorithm - is a solution to the single-source shortest path problem in graph theory.

Works on both directed and undirected graphs. However, all edges must have nonnegative weights.

Approach: Greedy Input: Weighted graph G={E,V} and source vertex vV, such that all edge weights are nonnegative

Output: Lengths of shortest paths (or the shortest paths themselves) from a given source vertex vV to all other vertices

dist[s] 0 (distance to source vertex is zero) for all v V{s} do dist[v] (set all other distances to infinity) S (S, the set of visited vertices is initially empty) QV (Q, the queue initially contains all vertices) while Q (while the queue is not empty) do u mindistance(Q,dist) (select the element of Q with the min. distance) SS{u} (add u to list of visited vertices) for all v neighbors[u] do if dist[v] > dist[u] + w(u, v) (if new shortest path found) then d[v] d[u] + w(u, v) (set new value of shortest path) (if desired, add traceback code) return dist

The simplest implementation is to store vertices in an array or linked list. This will produce a running time of O(|V|^2 + |E|)

For sparse graphs, or graphs with very few edges and many nodes, it can be implemented more efficiently storing the graph in an adjacency list using a binary heap or priority queue. This will produce a running time of

O((|E|+|V|) log |V|)

As with all greedy algorithms, we need to make sure that it is a correct algorithm (e.g., it always returns the right solution if it is given correct input).

A formal proof would take longer than this presentation, but we can understand how the argument works intuitively.

If you cant sleep unless you see a proof, see the second reference or ask us where you can find it.

To understand how it works, well go over the previous example again. However, we need two mathematical results first: Lemma 1: Triangle inequality If (u,v) is the shortest path length between u and v, (u,v) (u,x) + (x,v) Lemma 2: The subpath of any shortest path is itself a shortest path.

The key is to understand why we can claim that anytime we put a new vertex in S, we can say that we already know the shortest path to it. Now, back to the example

As mentioned, Dijkstras algorithm calculates the shortest path to every vertex. However, it is about as computationally expensive to calculate the shortest path from vertex u to every vertex using Dijkstras as it is to calculate the shortest path to some particular vertex v. Therefore, anytime we want to know the optimal path to some other vertex from a determined origin, we can use Dijkstras algorithm.

- Traffic Information Systems are most prominent use - Mapping (Map Quest, Google Maps) - Routing Systems

One particularly relevant this week: epidemiology

Prof. Lauren Meyers (Biology Dept.) uses networks to model the spread of infectious diseases and design prevention and response strategies.

Vertices represent individuals, and edges their possible contacts. It is useful to calculate how a particular individual is connected to others.

Knowing the shortest path lengths to other individuals can be a relevant indicator of the potential of a particular individual to infect others.

REFERENCES

Dijkstras original paper: E. W. Dijkstra. (1959) A Note on Two Problems in Connection with Graphs. Numerische Mathematik, 1. 269-271. MIT OpenCourseware, 6.046J Introduction to Algorithms. < http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-ComputerScience/6-046JFall-2005/CourseHome/> Accessed 4/25/09 Meyers, L.A. (2007) Contact network epidemiology: Bond percolation applied to infectious disease prediction and control. Bulletin of the American Mathematical Society 44: 63-86. Department of Mathematics, University of Melbourne. Dijkstras Algorithm. <http://www.ms.unimelb.edu.au/~moshe/620261/dijkstra/dijkstra.html > Accessed 4/25/09

- Dijkstra's AlgorithmUploaded byAlexander Obi Davids
- 10.1.1.131Uploaded byVipin Singh
- Energy Optimized Topologies for DistributedUploaded bybhanupartapsharma
- IJETT-V2I1P204Uploaded bysurendiran123
- 06 Advanced Centrality ConceptsUploaded bymorgoth12
- MS 4 Assigments ResitUploaded byjuan
- New Microsoft Office Word 97 - 2003 DocumentUploaded byPrakash Reddy
- Bachelorarbeit - SLAMUploaded byAnh Đinh Vương
- Duty-Cycle-Aware Minimum Latency Broadcast Scheduling in Clustered Multi-hop Wireless NetworksUploaded byeditor3854
- 6689_01_rms_20130307.pdfUploaded byrichardchan001
- Shortest PathUploaded bySachin Prakash
- Dynamic ProgrammingUploaded bysattAR
- Dijkstra's Shortest Path AlgorithmUploaded bysreehari
- se lec36Uploaded byKamesh Singh Jadoun
- A Greedy Scheme for Designing Delay Monitoring Systems of IP NetworksUploaded bynarayananamit
- hw3Uploaded byspamspamspans
- Zsuzsanna Dancso- On a universal finite type invariant of knotted trivalent graphsUploaded byGmonicon
- 10.1.1.64Uploaded byPrabhat Pinnaka
- AbsA divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,2,...|V |} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then number of edges labeled with 0 and thenumber of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. In this paper we prove that helm Hn , flower graph Fln and Gear graph Gn are divisor cordial graphs. Moreover we show that switching of a vertex in cycle Cn , switching of a rim vertex in wheel Wn and switching of the apex vertex in helm Hn admit divisor cordial labeling.tractUploaded bykarthikroshan3
- ReportUploaded bySkardu Yulmi
- ch 3Uploaded byapi-245312628
- Nov_2007Uploaded byrubina.sk
- Maximum Spanning Tree Model on Personalized Web Based Collaborative Learning in Web 3.0Uploaded byijcseit
- 41 Undirected GraphsUploaded byMarcus Braga
- Regular and Irregular Progressive Edge-GrowthUploaded byĐức Nguyễn
- Lecture 5Uploaded byKostis Koutsoukos
- Lecture 3Uploaded bySandeep Srikumar
- Graphs Lecture 2Uploaded bymolu
- igraphUploaded byΧρήστος Ντάνης
- SPLIT BLOCK SUBDIVISION DOMINATION IN GRAPHSUploaded byInternational Jpurnal Of Technical Research And Applications

- Novell Interview ExperienceUploaded by_Nishant_
- Multiplicative Inverse Using the Extended Euclid's AlgorithmUploaded byBarry Jordan
- Minimum Spanning TreeUploaded by_Nishant_
- TEM, TE & TM wavesUploaded by_Nishant_
- FIR Filter Design TechniquesUploaded by_Nishant_
- Misra RulesUploaded bymuniandi_ganesan
- Instruction Set 8085Uploaded byali.sohail007412
- BfsUploaded by_Nishant_
- ADH8066 GSM Module AT-Commands v1.6Uploaded by_Nishant_
- Demo Dfs Directed 1Uploaded by_Nishant_
- GSM 7-Bit Default Alphabet Table (With Character Codes of ISO 8859 Latin 1)Uploaded by_Nishant_
- Demo Dfs UndirectedUploaded by_Nishant_
- Basic Windows 2000 SkeletonUploaded by_Nishant_

- Hibernate Tools Reference GuideUploaded byladelosbomberos
- Bacardit - Learning Classifier Systems - 2009Uploaded byDede Firmansyah
- Creating a Javabean Using Netbeans IDEUploaded bySobhan Dasari
- TutorialUploaded byAlanoud Alsalman
- Ani-ShellUploaded byanon_18172460
- MeasureCamp - JavaScript TricksUploaded bySastry
- Assignment TechniqueUploaded byRahul Khosla
- IDENTIFIERSUploaded byTARIQHASSAN
- Saldana 2009 the Coding Manual for Qualitative ResearchersUploaded bylenguajeimlp
- CURSOR.pdfUploaded byMerry Sinha
- csc113-lab-2Uploaded byEbtisam Hamed
- BI Analytics on Excel - Alberto GuillenUploaded bybidump
- Common Issues With Oracle Text Search on the Content Server - OTS - Oracle Text SearchUploaded byJuan Tmtestme
- doc0936.pdfUploaded byAlpesh Shah
- Doc 8453Uploaded byVishal Gudla Nagraj
- 2nd unit - 2mUploaded byPushpa Ramakrishnan Iyer
- 11 Java Layout ManagersUploaded byLương Đình Tháp
- PLSQL Standards Developed for the PLSQL Starter Framework-1.pdfUploaded byroebruck
- Win2008_EProcessUploaded by田謹惟
- Exam Example, Programming IUploaded byspcg
- ott-03-0035 Unicode and C Business FunctionsUploaded byVince Liu
- Splunk-7.0.0-AdvancedDev - Developing Views and Apps for Splunk WebUploaded byjeff
- IBM - RefactoringUploaded byLucía Mora
- Reverse Engineering for BeginnersUploaded byFrank
- Algorithm and programming concepts, sample questionUploaded bynitish_shaw
- cUploaded byapi-245103214
- BEST PRACTICE SHEET FOR NON PROGRAMMERUploaded byNavin Kumar
- Java NotesUploaded byvankk
- (Www.entrance-exam.net)-HCL Placement Paper C LanguageUploaded byAswin Kumar
- c Sharpcorner ComUploaded byp rajshekhar rao