|
gptkbp:instanceOf
|
gptkb:graph
|
|
gptkbp:hasEdge
|
edge
|
|
gptkbp:hasLeaf
|
vertex of degree 1
|
|
gptkbp:hasProperty
|
no cycles
connected
|
|
gptkbp:hasSpecialCase
|
gptkb:forest_(graph_theory)
|
|
gptkbp:hasType
|
gptkb:red-black_tree
gptkb:tree
gptkb:phylogenetic_tree
gptkb:Fenwick_tree
gptkb:search_tree
gptkb:suffix_tree
AVL tree
B-tree
trie
spanning tree
expression tree
game tree
k-ary tree
labeled tree
ordered tree
parse tree
rooted tree
segment tree
unlabeled tree
|
|
gptkbp:hasVertex
|
gptkb:node
|
|
gptkbp:isA
|
connected acyclic graph
|
|
gptkbp:maximumEdges
|
n-1
|
|
gptkbp:minimumEdges
|
n-1
|
|
gptkbp:numberOfSides
|
n-1
|
|
gptkbp:rootedVariant
|
rooted tree
|
|
gptkbp:spanningTreeOf
|
connected graph
|
|
gptkbp:supportsAlgorithm
|
gptkb:breadth-first_search
depth-first search
minimum spanning tree
tree traversal
|
|
gptkbp:usedIn
|
computer science
hierarchical modeling
data structures
phylogenetics
network design
|
|
gptkbp:vertices
|
n
|
|
gptkbp:bfsParent
|
gptkb:Cayley_tree
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
tree (graph theory)
|