When every edge in an acyclic graph is undirected, it is called an undirected acyclic graph. It is also called as undirected forest.
What is an undirected acyclic graph?
September 14, 2023 in Data Structure
September 14, 2023 in Data Structure
When every edge in an acyclic graph is undirected, it is called an undirected acyclic graph. It is also called as undirected forest.