Tree (graph theory)Arbre
Undirected, connected, and acyclic graphGraphe non orienté, connecté et acyclique
In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected acyclic undirected graph.En théorie des graphes, un arbre est un graphe acyclique et connexe. Sa forme évoque en effet la ramification des branches d'un arbre.
