tree
A directed acyclic graph i.e. a graph wherein there is only one route between any pair of nodes, and there is a notion of "toward top of the tree" (i.e. the root node), and its opposite direction, toward the leaves. A tree with n nodes has n-1 edges. Although maybe not part of the widest definition of a tree, a common constraint is that no node can have more than one parent. Moreover, for some applications, it is necessary to consider a node' s daughter nodes to be an ordered list, instead of merely a set. As a data structure in computer programs, trees are used in everything from B-trees in databases and file systems, to game trees in game theory, to syntax trees in a human or computer languages. (1998-11-12) In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ag ] [ ai ] [ am ] [ an ] [ app ] [ application ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ av ] [ B ] [ b ] [ ba ] [ base ] [ be ] [ B-tree ] [ ca ] [ cat ] [ ch ] [ cl ] [ co ] [ com ] [ computer ] [ computer program ] [ con ] [ cons ] [ constraint ] [ cy ] [ data ] [ database ] [ data structure ] [ daughter ] [ de ] [ directed acyclic graph ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ file system ] [ fo ] [ for ] [ fr ] [ ga ] [ game tree ] [ ge ] [ gh ] [ gr ] [ graph ] [ gu ] [ h ] [ hat ] [ hing ] [ hr ] [ ht ] [ hu ] [ id ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ language ] [ leaves ] [ Lex ] [ li ] [ list ] [ lt ] [ ly ] [ M ] [ ma ] [ man ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ ne ] [ ng ] [ ni ] [ nl ] [ no ] [ node ] [ ns ] [ om ] [ op ] [ pa ] [ parent ] [ ph ] [ pl ] [ pr ] [ program ] [ query ] [ rc ] [ re ] [ ro ] [ root ] [ root node ] [ route ] [ ru ] [ sa ] [ se ] [ set ] [ si ] [ sit ] [ so ] [ st ] [ struct ] [ sy ] [ syntax ] [ syntax tree ] [ system ] [ th ] [ theory ] [ to ] [ tr ] [ tw ] [ ua ] [ ug ] [ um ] [ us ] [ ve ] [ yt ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (7005 Reads) |
