What is an undirected acyclic graph?

When every edge in an acyclic graph is undirected, it is called an undirected acyclic graph. It is also called as undirected forest.

Sanisha Maharjan
Jan 23, 2022
More related questions

Questions Bank

View all Questions

Top