Need some help in solving this algorithm problem in C#

Question

1.00/5 (1 vote)

See more:

Directed graph and multiple edges are given as a single component. Determine whether the graph is a tree or not. In this case, it is required to determine if the graph is a cyclic graph (Contains Cycles) which contains a path from at least one node back to itself

Implement the following isTree function to return true or false as a description for the given graph.

"" static bool IsTree(string[] vertices, List<keyvaluepair<string, string="">> edges) ""

Thanks in advance

What I have tried:

this is the function that i have to code ... i know the logical idea using the DFS but i need some help to implement it cuz iam studying on my own

Posted 5-Jan-21 12:01pm

Mostafa Ayman

Updated 5-Jan-21 12:33pm

Add a Solution

1 solution

Add a Solution

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Afzaal Ahmad Zeeshan · Answer 1 · 2021-01-05T12:33:00

Quote:
Determine whether the graph is a tree or not

Well use the basic hint to see whether a graph is a tree or not; a tree is a graph that doesn't allow going from a child node to a parent node.

I can also give you a hint, that the space complexity of this could be O(N) since you need to know if you are ever visiting a parent node.

Good luck!

Quote:
if the graph is a cyclic graph (Contains Cycles) which contains a path from at least one node back to itself

Read the 2 paragraphs above and you will be able to understand what I mean.

Need some help in solving this algorithm problem in C#

1 solution

Solution 1

Add your solution here

Preview 0

Need some help in solving this algorithm problem in C#

1 solution

Solution 1

Add your solution here

Preview 0

Existing Members

...or Join us