I use Yed to draw some graphs as shown in the image below. Is there a way that I can use python to calculate depth-first exploration on them? I would like the algorithm to log the edges and nodes it visited that it visited.
Graph example:
Edit: I would like to use this method to record the actions of people in a sports game. First you start with the base / Root, then you can run or jump (c or d). Running will lead you to step 2, jumping to step 5. As a result, I will need the following:
1. root, ([c,2] ,[b,3]), Descript_3
2. root, ([c,2] ,[a,4]), Descript_4
3. root, ([c,2] ,[b,2], [a,4]), Descript_4
...
yed, . - , . . ?
:
, . :
1. Parse the graphml-File and build up the tree
2. Compute all Roundtrip-Path with Node-Coverage
3. write all paths into a table: Name of the node, Text on the arrow
. , , . .