Graph Theory

o Graph theory is a branch of mathematics concerned about how

networks can be encoded and their properties measured.

o A graph is a symbolic representation of a network. It implies an

abstraction of the reality so it can be simplified as a set of linked
nodes
o The goal of a graph
is representing the
structure, not the
appearance of a
network. The
conversion of a
real network in a
planar graph
follows some basic
rules: Graph Representation of a Road Network
 Graph Theory
Some Definitions
Graph: A transportation network, like any network, can be represented
as a graph. A graph G is a set of vertex (nodes) v connected by edges
(links) e. Thus G = (v, e). If weights are attached to edges or vertices, or
both vertices and edges, then the graph is called weighted graph.

Sub-Graph: A sub-graph is a subset of a graph. For instance, the road

transportation network of a city is a sub-graph of a regional
transportation network

Vertex (Node): A node v is a

terminal point or an
intersection point of a graph.
It is the abstraction of a
location such as a city, a road
intersection, or a transport
terminal (stations, airports). Basic Graph Representation of a Transport Network
 Graph Theory
Some Definitions
Edge (Link): An edge e is a link between two nodes. The link (i, j) is of
initial extremity i and of terminal extremity j. A link is the abstraction of
a transport infrastructure supporting movements between nodes. It has
a direction that is commonly represented as an arrow. When an arrow is
not used, it is assumed the link is bi-directional

This graph has the following

definition:

G = (v, e)
v = (1,2,3,4,5)
e = (1,2), (1,3), (2,5), (4,2), (4,3), (4,5)
 Graph Theory
Some Definitions
Root: A root is generally the
starting point of a distribution
system. Node 1 is the only root of
the graph below as every other
node is part of a path originating
from node 1. Root of a Road Network

Trees: A connected graph without

a cycle is a tree. A tree has the
same number of links than nodes
minus one. (e = v-1).

Tree graph having node 1 as a root

 Graph Theory
Some Definitions
Cycle: A chain where the initial and
terminal node is the same.

Circuit: A path where the initial and

terminal nodes correspond. It is a Graph, 2-3-6-5-2 is a cycle but not a
cycle where all the links are traveled circuit. 1-2-4-1 is a cycle and a circuit
in the same direction.

Order (degree) of a Node (o): The

order of a node is the number of
its attached links and is a simple,
but effective measure of nodal
importance. Hub nodes have a high
order, while terminal points have
an order that can be as low as 1.
Order of a Node
 Shortest Path Problem
Dijkstra’s Algorithm

b 13 f

8 3
2
6 2
h
a 5 d
3 6
2 2
1
1 g
5
c e
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a
8

8
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a
8

8
c 8a 2a 4c 7c 8

8
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c
8

8
d 6d 4c 5d 10d 7d

8
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c
8

8
d 6d 4c 5d 10d 7d

8
e 6d 5d 10d 6e

8
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c
8

8
d 6d 4c 5d 10d 7d

8
e 6d 5d 10d 6e

8
b 6d 10d 6e
8
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c
8

8
d 6d 4c 5d 10d 7d

8
e 6d 5d 10d 6e

8
b 6d 10d 6e
g 8g 6e 8
12g
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c
8

8
d 6d 4c 5d 10d 7d

8
e 6d 5d 10d 6e

8
b 6d 10d 6e
g 8g 6e 8
12g
f 8g 11f
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h
a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c
8

8
d 6d 4c 5d 10d 7d

8
e 6d 5d 10d 6e

8
b 6d 10d 6e
g 8g 6e 8
12g
f 8g 11f
h 11f
 Shortest Path Problem
Dijkstra’s Algorithm

V a b c d e f g h a > c > d > e > g > f > h (11)

a 0a 8a 2a 5a 8

8
c 8a 2a 4c 7c See the minimum of h is
8

8
11 coming from f then see
d 6d 4c 5d 10d 7d

8
at f min from g then see at
e 6d 5d 10d 6e g min from e then see at e

8
b 6d 10d 6e min from d, then d is from
8
c, then c from a.
g 8g 6e 12g
f 8g 11f
h 11f
 Shortest Path Problem
Dijkstra’s Algorithm

b 13 f

8 3
2
6 2
h
a 5 d
3 6
2 2
1
1 g
5
c e

10
 Shortest Path Problem
Dijkstra’s Algorithm Reached Table
Set the origin node as reached, Node Cumulative Previous
place it on the reached table, and length Node
scan the adjacent nodes a 0 none
b

Pick the scanned node with the c 2 a

lowest cumulative length and put d
it on the reached table
e
f
g

Any more No h
nodes to scan?
Scanned Table
Yes Node Cumulative Previous
length Node
Scan nodes adjacent to the node b 8 a
just reached and put them on the
scanned table c 2 a

d 5 a
Trace shortest path between
origin and destination
 Shortest Path Problem
Dijkstra’s Algorithm
b 13 f

8 3
2
6 2
h
a 5 d
3 6
2 2
1
1 g
5
c e

10
 Class Assignment
Dijkstra’s Algorithm

b 5 d

4 6

1 8 f
a 2

2 3

c 10 e