It can be relevant to spotlight that each time a sequence can not repeat nodes but can be a closed sequence, the sole exception is the first and the last node, which have to be a similar. How to define Shortest Paths from Supply to all Vertices using Dijkstra's Algorithm https://epicurusk162ggg8.wikiexcerpt.com/user