There are at most (O(\log V)) rounds for (V) vertices (each round adds at least one edge per remaining tree in a connected component, and the number of trees shrinks). The implementation also supports ...
# Official 18 districts with their OSM relation IDs for precise lookup. # Using relation IDs avoids ambiguity from name-only searches.
一部の結果でアクセス不可の可能性があるため、非表示になっています。
アクセス不可の結果を表示する