java - (Algorithm) find nodes having single path to reach from one node to other -
i wanted know fastest algorithm finding nodes have path 1 node other nodes. 
these nodes represented in string this:
string path = "({a,b,c,d,e,f},{(a,c),(b,c),(c,e),(b,e),(b,d),(e,f)})"; output should this:
output = {(a,c),(b,d),(e,f)} i tried split() method long procedure appreciate can give me in working problem
it seems me need to:
- find cycles in graph
- eliminate edges contribute cycle
Comments
Post a Comment