home AS/A2 d1 AS/A2

D1 Topic 2: Algorithms on graphs
Dijkstra's algorithm backmore

 View full screen  


Summary
A graph is a set of points, called vertices or nodes, connected by lines called edges or arcs. A simple graph is one that has no loops and in which no pair of vertices are connected by more than one edge. The number of edges incident on a vertex is called its order, degree or valency.
Flash powered - you will need the Flash 5 plugin This page uses Macromedia Flash. Your browser will need to have the Flash plugin installed - freely available from Macromedia.