I want to go to all the stations on the Singapore MRT. This is image of mrt map as of 2024:
Assume this MRT network is an undirected, weighted, sparse graph where stations are vertices and tracks are edges, and the edges are weighted by the time taken between each station.
What is the fastest route if the start and end points do not have to be the same?
I don't see how I could use TSP or OTSP since they both state you can only visit a city once when there are a few "deadends" in the MRT map which necessitates going back to the same station.
sidenote: I am just a high school student and still new to graph theory