Please enable JavaScript.
Coggle requires JavaScript to display documents.
BANGKOK TRAFFIC PROJECT PLAN :red_flag: (Factors :pencil2: (Types of…
BANGKOK TRAFFIC PROJECT PLAN :red_flag:
Factors :pencil2:
Types of Transportation
BTS + walk
Nearest to Aj.Brian's house : Mochit station
Nearest to School : Siam station
Bus
Nearest to Aj.Brian's house : Route 24, 26, 34, 136, 174
Nearest to school : Route 16, 21, 34
MRT + walk
Nearest to Aj.Brian's house : Ladprao Station
Nearest to School : Sam Yan Station
Personal Car
Honda City
13.7 L/km
Expressway
50 Baht
Taxi
Total distance : 18.536kms
GrabTaxi
Uber and GrabCar will not be included due to no law regulations
Cost
BTS
42 Baht
MRT
42 Baht
Bus
Route 104 : 14 Baht
Free
Taxi (from Ajarn home to PDS) #according to
http://bangkokhasyou.com/bangkok-taxi-fare-calculator/
Normal traffic (76 minutes, with 15 minutes of slow traffic)
: 291 Baht
Bad traffic (101 minutes, with 17 minutes of slow traffic)
: 340 Baht
Very clear traffic (38 minutes, with 13 minutes of slow traffic)
: 214 Baht
Horrible traffic (203 minutes, with 23 minutes of slow traffic) : 544 Baht
Car (Fuel)
E20
Cheapest : 24.14 Baht/L
Benzine91
Cheapest : 26.65 Baht/L
Peak Times
Evening
5 pm - 7 pm
Morning
7 am - 9 am
Time Required
MRT + walk
MRT
24 min
walk
Home & MRT
too far to walk, needs to use bus (126ร)
School & MRT
17 min
BTS + walk
BTS
14 min
walk
Home & BTS
too far to walk, needs to use bus (104)
School & BTS
5-10 min
Taxi, Bus, Personal Car
38-203 min depending on traffic
Taxi, Bus : +waiting time
Calculations :unlock:
Graph Theory
Traversal graph
Depth-first search(DFS)
Algorithm for traversing the graph by tracking only one route to the end. Then, move on to next route.
Breadth-first search(BFS)
Algorithm for searching graph by starting from the tree root(starting nodes) and then traverse the neighbor nodes first. Then move on to the next level.
made up of
vertices
where two edges are connected
the synonym of nodes
edges
weighted edges
line that connect two vertices
nodes
as same as vertices
the point or the position
Weight graph
Every edge on the graph is weighted
Weight may represent
costs
Distance
time taken
Canadian Traveller Problem
Evaluation for Final Decision :checkered_flag:
Dijkstra's algorithm
Floyd–Warshall algorithm
Bellman–Ford algorithm
By : Paan 6 Iris 12 Dear 13 Max 15