Jisho

×
木 (数学)
Links
Wikipedia definition
1. Tree (graph theory)​In mathematics, more specifically graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one simple path. In other words, any connected graph without cycles is a tree. A forest is a disjoint union of trees. The various kinds of data structures referred to as trees in computer science are equivalent to trees in graph theory, although such data structures are commonly rooted trees, and may have additional ordering of branches.
Read “Tree (graph theory)” on English Wikipedia
Read “木 (数学)” on Japanese Wikipedia
Read “Tree (graph theory)” on DBpedia

Discussions

to talk about this word.