Welcome to Westonci.ca, the place where your questions are answered by a community of knowledgeable contributors. Discover precise answers to your questions from a wide range of experts on our user-friendly Q&A platform. Experience the convenience of finding accurate answers to your questions from knowledgeable experts on our platform.

Let G = (V, E) be an undirected graph. Design algorithms for the following (in each
case discuss the complexity of your algorithm):
(a) Assume G contains only one cycle. Direct the edges s.t. for each u, indegree(u) [tex]\leq[/tex] 1.
(b) Determine whether it is possible to direct the edges of G s.t. for each u, indegree(u) [tex]\geq[/tex] 1.
If it is possible, your algorithm should provide a way to do so.
(c) Let S be a subset of edges s.t. every cycle of G has at least one edge in S. Find a
minimum size subset S.

Sagot :

Answer:

i think its b if not sorry

Explanation:

We hope you found what you were looking for. Feel free to revisit us for more answers and updated information. We hope our answers were useful. Return anytime for more information and answers to any other questions you have. Westonci.ca is here to provide the answers you seek. Return often for more expert solutions.