Bike Lane Theory

2449 Words10 Pages
This paper uses graph theory in discussing the application of bike lane in a city which has a population ranging from 70,000- 100,000 residents so that we can calculate shortest path between two locations which are the vertices. Edges in this particular graph are the streets of the city. The way in which these streets are chosen is called routing problem

1 Introduction
Graph theory is a branch of has applications in various fields of life ranging from transportation, financial institutions, communication etc. it was first introduced in the eighteen century by Euler to solve the famous Konigsberg Bridge problem. Graphs and networks have attracted a great deal of interest in the last few years. Graph theory has
…show more content…
On the other hand, for such roads and parkways being characterized as edges or circular segments of this graph, there is a requirement for an investigation on the presence of space for developing the bike lane, since it is as a rule as of right now where the troubles lie in a city. The vertices of this diagram will be the convergences of these…show more content…
This is the path, i.e. the bike lane way spoke to by a customary graph of degree 2 named on circular arcs and vertex, being likewise an associated planar graph. This path is likewise viewed as a cycle, as one can start the way at a vertex and completion at the same

More about Bike Lane Theory

Open Document