Hi guys,let's say I have an undirected unweighted graph,where each edge can be "visited" only once.How can I get the longest path of this graph? Thanks for every help
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
