## Dijkstra's algorithm

Dijkstra's algorithm shortest path algorithm is one of the most commonly used algorithms for finding short distances between two nodes.
This article list down some of the important points for this algorithm and list down some of the useful contents available online.

### Important Points

It does not work if the edges have negative weights.
It is used to find shortest path between source and destination in a graph.
Real life uses includes Map, Network communication.

### Complexity

The complexity of this algorithm depends on the data structure used.
For a graph G with V vertices and E edges,
For Adjecency Matrix : Complexity is O(V**2)
For Adjecency List and using Priority Queue with O(n) for sorting : O(E + VlogV)

Casino Hotel - Mapyro

ReplyDeleteFind 경상북도 출장마사지 all information and best deals of 밀양 출장샵 Casino Hotel, Murphy 충청남도 출장마사지 Casino Hotel Murphy in Murphy, New Jersey, United States. Map. Address. 0.3 태백 출장샵 miles 군포 출장마사지 from