Help needed in a question!

Revision en1, by siddhi, 2019-07-29 16:11:52

You are given a graph with some of its edges are directed and some are un-directed. You have to return true/false depending upon if you can convert all the undirected edges in directed ones such that there is no cycle in graph return true else return false..

Can some please some help on how to approach this problem?

Thanks in advance :)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English siddhi 2019-07-29 16:11:52 372 Initial revision (published)