# lec23 - ECE 333 Introduction to Communication Networks Fall...

This preview shows pages 1–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3 Dijkstra’s Algorithm Given a graph for the entire network, Dijkstra's Algorithm can be used to find the shortest paths from a given node to every other node. The basic idea of Dijkstra's algorithm is to first find the closest node, then the second closest node, etc. For a given node, s , notice the first closest node must be a neighbor of s and the second closest node must either be a neighbor of
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/12/2009 for the course ECE ECE 333 taught by Professor Randallberry during the Fall '02 term at North-West Uni..

### Page1 / 6

lec23 - ECE 333 Introduction to Communication Networks Fall...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online