Application of network computation and graph theory to solve NYC's traffic woes.

1. Getting around NYC
CAN GRAPH THEORY HELP?

2. Example of New York Traffic Route Congestion

3. General effects due to congested traffic/problems
● Time loss for public/passengers.
● Money loss due to loss of fuel.
● Increased road accidents due to over speed to make
up the time lost in traffic.

4. Graph Theory
The practical approach of graph theory can be
applied to solve traffic problems, as it is the
combination of vertices/nodes and edges. It
can be used to built a network connecting n-
nodes (boroughs, blocks, neighborhoods etc.)
via roads leading to different places and
destinations.

5. Flow Chart
Traffic Data Collection
Graph Modeling (plotting data)
Graph Bipartioning( possible routes)
Applying Algorithms on data sets
Output(suitable path)

6. Implementation
● DFS : (Depth First Search)
(1) Bridge Detection
(2) Strongly Connected Components
● Dijkstra's Algorithm :
(1) Finding shortest path among
destinations.

7. Grid System
● New York is a city which is mostly planned on a grid system and built to be
walker-friendly.
● Traffic congestion leads to several problems and cause lot of personal losses
directly to the public.
● Traffic jams are at their worst in Manhattan, a short drive can turn into an
extended stay on the Long Island Expressway

8. Possibilities with Network
Subtraction
● Network Subtraction method can also applied to the traffic congestion
problem of New York, in order to regulate huge traffic on the road.
● In this method we can subtract some grid network according to
requirement to regulate the traffic congestion and its proper handling.

9. To come
 More on network computation.

10. Your task as a team
 Next one week find out all the sources of data on NYC
traffic