Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations IamaSherpa on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
-
Graph problem; I want to visit all the edges
Hi Kathleen, This is the perfectly right answer and exactly what I mean. All the edges are visited at least once, when we look at all the paths and each path goes from start to end. Thank you very much for your excellent and quick answer! Leon -
Graph problem; I want to visit all the edges
Hi Kathleen, I want all the paths from start to end whereby each edge is visited maximum once WITHIN 1 path but over the totality of al the paths each edge is visited minimum once. For example arc(start screen, wrong user name, start screen). arc(start screen, wrong password, start screen)... -
Graph problem; I want to visit all the edges
Hello, I'm working on a test case generation problem. I made a model of an application as a graph whereby the vertices are screens where a user is in. Through user inputs he reaches the same of a next screen. The graph is a multi arc network, there can be more arcs between two vertices, the...
