Let's say I have a set of non-repeating arcs, e.g.
(0,1), (3,0), (0,3), (1,2), (2,3), ("set" because they don't repeat).
Here's an example of a graph for which this series of arcs would form a valid path:
And a valid path would be
(0,1), (1,2), (2,3), (3,0), (0,3).
Note that the path might not be unique (and that's fine). And I don't care where we start in the path, as long as all arcs in the set are traversed.
Given a directed adjacency matrix, how to put together a path describing this set of arcs? Seems to me like there should always be a way to do this. Having trouble putting together an algorithm to do so.
This question is related, but I'm trying to generalize from this: https://stackoverflow.com/questions/53761877/get-route-from-unordered-set-of-tuples