Search results
26 sie 2023 · OpenRailwayMap seems to cover a lot of railway lines, but I couldn't see any option to find the distance between two stations. I am generally interested in doing this across Europe, but specifically at least in Germany.
Divide the distance between their starting points by the closing speed, to get how long it'll take them to meet. Then multiply the speed of one train by that time, to find out how far from that train's starting point they'll be when they meet.
7 wrz 2021 · In one country every two cities are connected with direct transport line-by train or bus. Prove that from any city in this country, with possible transfers, we can reach every other city using only one tipe of transport(bus or train).
10 sty 2009 · I want to be able to quickly compute directions from one arbitrary point to another. Sometimes these points will be close together (within one city) while sometimes they will be far apart (cross-country). Graph algorithms like Dijkstra's algorithm will not work because the graph is enormous.
Distance calculator helps you to find the distance between cities and calculate the flying distance in both kilometers and miles.
This map shows you how far you can travel from each station in Europe in less than 8 hours. Hover your mouse on the map to see the isochrones from that city, search for a station, or click on one of the examples below.
In the class Graph, implement the method computeAllEuclideanDistances() which should compute the euclidean distance between all cities that have a direct link and set the weights for the corresponding edges in the graph. The euclidean distance between two points (ux, uy) and (vx, vy) is defined as sqrt((ux-vx)^2 + (uy-vy)^2).
