Science Fair Project Encyclopedia
In graph theory, a tree is a graph in which any two points, or vertices, are connected by exactly one path (i.e. there are no cycles). A forest is a graph in which any two vertices are connected by at most one path. An equivalent definition is that a forest is graph of one or more (unconnected) trees (hence the name). Trees are useful abstract structural representations of many different concepts.
Articles in category "Trees (structure)"There are 63 articles in this category.
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details