algorithm - Graph backtrack complexity -
i'm trying analyse complexity of backtracking graph in order find longest path.
my algorithm consists of topological sort , backtrack each vertex in order find longest path.
if helps, algorithm basically: topological sort(g), each vertex calculate distance each other vertex ,return maximum distance
anyway, don't know worst case complexity of backtrack operation.
any suggestions?
thanks in advance!
Comments
Post a Comment