The document discusses how graph theory can be used to analyze transportation networks. It defines key terms like nodes, links, routes, and networks. It then describes several metrics that can be used to evaluate network properties like traffic flow, connectivity, and efficiency. These include measures of degree, diameter, redundancy, connectivity, shape, distance, and density. Graph analyses allow transportation planners to quantitatively assess network characteristics and performance.
The document discusses how graph theory can be used to analyze transportation networks. It defines key terms like nodes, links, routes, and networks. It then describes several metrics that can be used to evaluate network properties like traffic flow, connectivity, and efficiency. These include measures of degree, diameter, redundancy, connectivity, shape, distance, and density. Graph analyses allow transportation planners to quantitatively assess network characteristics and performance.
The document discusses how graph theory can be used to analyze transportation networks. It defines key terms like nodes, links, routes, and networks. It then describes several metrics that can be used to evaluate network properties like traffic flow, connectivity, and efficiency. These include measures of degree, diameter, redundancy, connectivity, shape, distance, and density. Graph analyses allow transportation planners to quantitatively assess network characteristics and performance.
The document discusses how graph theory can be used to analyze transportation networks. It defines key terms like nodes, links, routes, and networks. It then describes several metrics that can be used to evaluate network properties like traffic flow, connectivity, and efficiency. These include measures of degree, diameter, redundancy, connectivity, shape, distance, and density. Graph analyses allow transportation planners to quantitatively assess network characteristics and performance.
Using graph analyses we are interested in measuring
such things as: 1. Traffic generated by nodes. 2. Flow along links. 3. Degree of accessibility and connectivity. 4. Spatial extent of a network. 5. Network association along a route. 6. Influence of one place on other places on a route or in a network.
Graph theory reduces transport networks to a
mathematical matrix whereby: Edge: Line segment (link) between locations. Example: roads, rail lines, etc Vertex: Location on the transportation network that is of interest (node). Example: towns, road intersections, etc In transportation analysis graphs are ALWAYS finite there are always constraining boundaries.
Node a location on a transportation route that has the
capacity to generate traffic (flow). Link the connection between 2 nodes along which flow occurs. Route a series of connected links. Network a system of nodes and links. May consist of several modal types (road, rail, etc), but is typically of a single mode type.
Road System: Meseta Tarasca, Michoacn, Mexico
Vertex/Node
Edge/Link
A few words about vertices (nodes):
1. Vertices must occur where 3+ edges meet. 2. The endpoints of edges are vertices. 3. Vertices can occur mid-link.
Directed graph direction of flow is explicit.
Undirected graph no flow direction implied. Loop flow from a node into itself. Planar graphs where all links (edges) meet at nodes (vertices). Non-planar graphs where links (edges) may cross each other. Element a graph cell (dyad).
Real World Road System
Planar Network
Topologic (geometric) distance a unit-less measure where
the distance between nodes is coded as a single step.
Distance is ONLY implied (e.g. more steps = longer
distance.
Real world distances are not used.
Essentially removes the influence of distance.
Real world distance
5 miles 7 miles
Topologic (geometric) distance
1 step 1 step
Example Graph Vertices = 8
Edges = 10
Diameter the number of links needed to connect the
two most remote nodes in a network. The route used must be the shortest possible. Backtracks, loops, and detours are excluded. Sometimes referred to as the longest, shortest path. In other words, the diameter is the maximum number of steps to connect any two points on a graph.
=ev+p where is the cyclomatic number, e is the number of edges, v is the number of vertices, and p is the number of subgraphs. Note: in most cases p = 1.
Vertices
Edges
=ev+p = 10 8 + 1 = 3
Therefore, the cyclomatic number is essentially the number
of closed circuits in the graph. It is a measure of route redundancy.
Minimum number of edges in a graph:
Min = v 1
Min = 8 1 = 7
Maximum number of circuits in a graph:
Max circuits = v (v 1) (v 1)
Note: not all vertices are shown.
Max circuits = 8 (8 1) (8 1) Max circuits = (4)(7) 7 = 21
Notice that there are several possible graphs that can
be drawn base on Min , but there is only one possible Max .
Min edges
Max circuits
Gamma a measure of graph connectivity and is a simple
measure to use. It can be thought of as the percent existing routes to potential routes.
interpreted as the average number of edges per vertex (average number of links per node).
=e/v
v=8 e = 10
= 10 / 8 = 1.25
Alpha a measure of graph connectivity that can be
interpreted as the ratio of existing circuits to the maximum possible circuits.
= e (v-1) / (0.5v(v-1)) (v-1)
v=8 e = 10
= 10 (8-1) / (0.5(8)(8-1)) - (8-1)
= 3 / (4)(7) - 7 = 3 / 21 = 0.143
Pi Index a the relationship between the total length of
the graph L(G) and the distance along its diameter D(d). A high index shows a developed network. It is a measure of distance per units of diameter and an indicator of the shape of the network.
= L(G) D(d)
L(G) = 82 D(d) = 29
= 11+10+10+8+8+8+7+6+8+6 8+7+6+8 = 82 29 = 2.83
Eta the average length per link. Adding new nodes will cause a decrease in eta as the average length per link declines.
= L(G) e
L(G) = 82 e = 10
= 11+10+10+8+8+8+7+6+8+6 10 = 82 10 = 8.2
Detour Index a measure of the efficiency of a network
in terms of how well it overcomes distance or the friction of distance. The closer the detour index gets to 1, the more the network is spatially efficient. Networks having a detour index of 1 are rarely, if ever, seen and most networks would fit on an asymptotic curve getting close to 1, but never reaching it.
DI = DD TD The straight distance (DD) between two nodes may be 40 km but the transport distance (TD; real distance) is 50 km. The detour index is thus 0.8 (40 / 50).
