Ekikan

Ekikan (駅間) is a Japanese term meaning the segment between railway stations on a line. It refers to the distance along the track from one station to the next on the same line, typically measured in kilometers. The concept is used in timetable planning, travel-time estimation, and fare calculation, and it reflects the actual length of the track between stations rather than a straight-line distance.

In data models of railway networks, ekikan is often represented as the edges of a graph: stations are nodes, and ekikan between adjacent stations are weighted edges. This representation supports computations such as shortest-path queries, route planning, and network analysis.

In educational and programming contexts, ekikan is also the name of a common reference dataset that encodes a railway network with stations, lines, and the ekikan distances between connected stations. The dataset is used to illustrate graph algorithms, including Dijkstra’s algorithm and other shortest-path techniques, in programming problems and textbooks.

Etymology and usage: the word is formed from eki (station) and kan (interval or distance). While the term is most closely associated with Japanese railways, the underlying idea—measuring the track distance between connected stations—is a general concept applicable to any segmented rail network.