What algorithms did you use to solve this problem?
My idea was to build a DAG out of strongly connected components and then traverse the graph from the entry till the exit node while keeping track of the vertices being visited. But WA..
Any guidance on this problem?
All about problems in Volume 130. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
1 post • Page 1 of 1
Who is online
Users browsing this forum: No registered users and 1 guest