In my previous article about an interactive map of the Moscow metro, I described the process of creating a vector map using an svg engine, comparing it with a canvas display.
After a while, I decided to return to my map and added to it the ability to display the route of the shortest path between the selected stations using the BFS algorithm , traversing the graph in width.
- UML, DTD . "" , .
, , , .
, :
()
, ( inches)
( inch): , , , . .
, . , , , , .
-, , Q , , . "", , .
-, . ( inch) , , . , , , , . , , , , . ( ). .
-, ECMA2015 let, const, Set, iPad 3G. var, function.
, , . ( ), .
, , svg, - .
Here are separate links to the metro map and the project in github .