I have a graph and i want to find the shortest path/route( i dont know which is the correct definition) that visits every vertex at least once. Is there an algorithm or a name for this problem so i could search it on my own? I dont care about code.
var
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)