Is there a way to achieve this in pydot?
Take the following example:
[Outputted Dot File]
strict graph g{
"A" -> "B";
"B" -> "C";
"C" -> "D";
"D" -> "E";
}
[Python]
print(num.start)
>>> A
print(num.steps)
>>> ["a,b","b,c","c,d","d,e"]
print(num.end)
>>> E
or with the following case:
[Outputted Dot File]
strict graph g{
"A" -> "B";
"B" -> "C";
"C" -> "A";
}
[Python]
if num["A"] == num.loop:
print("[%s] loop detected")%(num["A"])
Well you have the whole graph structure, via graph.get_edge_list() you can implement standard depth first search to find shortest path between nodes. Finding loops is likewise done with standard graph algorithms. See this article on Graph implementations in Python for sourcecode on how to do shortest path between two nodes.
If you're looking for the pydot library do do this for you, you might be out of luck.
Pydot can write dot files, but it is not for analyzing graphs.
You want NetworkX instead. It can read and write dot files, find circles, find reachable nodes and do topological sort.
Look up the terminology of graphs on wikipedia and NetworkX can do the rest.
