TERMIUM Plus^®

Record 1,  Textual support,  English

Record number: 1, Textual support number: 1 CONT

A series of destinations can be grouped into a nested graph within a parent navigation graph called the root graph.  2, record 1, English, - root%20graph

Record 1,  Textual support,  French

Record 1,  Textual support,  Spanish

Record number: 1, Textual support number: 1 PHR

Mediante los nodos decisión en el árbol, podemos definir contextos que nos permitan instanciar el grafo raíz con un contexto en particular.  1, record 1, Spanish, - grafo%20ra%C3%ADz

Record 2,  Textual support,  English

Record number: 2, Textual support number: 1 DEF

A graph traversal algorithm that explores nodes in the order of their distance from the roots, where distance is defined as the minimum path length from a root to the node.  3, record 2, English, - breadth%2Dfirst%20search%20algorithm

Record number: 2, Textual support number: 1 OBS

It starts at the tree root(or some arbitrary node of a graph, sometimes referred to as a 'search key’), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.  4, record 2, English, - breadth%2Dfirst%20search%20algorithm

Record 2,  Textual support,  French

Record number: 2, Textual support number: 1 CONT

L'algorithme de parcours en largeur permet de calculer les distances de tous les nœuds depuis un nœud source dans un graphe non pondéré (orienté ou non orienté). Il peut aussi servir à déterminer si un graphe non orienté est connexe.  3, record 2, French, - algorithme%20de%20parcours%20en%20largeur%20d%27abord

Record 2,  Textual support,  Spanish

Record 3,  Textual support,  English

Record number: 3, Textual support number: 1 CONT

There is an example of a tree :root A; branches AB, AC, AD; children B, C, D; branches BE, BF, CG, CH, HI; leaves E, F, G, H, I; C is a parent of G and H; G and H are the children of C; C is an ancestor of I; I is a descendant of C. This tree has 4 levels : level o(root) ;level 4(B, C, D) ;level 2(E, F, G, H) and level 3(I). As mentioned, most problems do not permit the entire tree/or graph) to be generated at one time; hence, different search strategies have been developed.  2, record 3, English, - ancestor

Record 3,  Textual support,  French

Record number: 3, Textual support number: 1 DEF

Dans un graphe, arbre ou arborescence, tout sommet qui n'est pas une feuille, y compris la racine, et qui a des descendants à deux niveaux d'épaisseur au moins.  3, record 3, French, - anc%C3%AAtre

Record number: 3, Textual support number: 1 CONT

Ces arbres peuvent être considérés comme un exemple simplifié de réseaux sémantiques [...] des réseaux dont le type d'arc est limité à des relations hiérarchiques utilisées par des procédures de contrôle comme mécanismes d'héritage ou transmission de propriétés d'un nœud ancêtre (plus général) vers son ou ses nœuds progéniture (plus spécialisés).  2, record 3, French, - anc%C3%AAtre

Record 3,  Textual support,  Spanish

Record 4,  Textual support,  English

Record number: 4, Textual support number: 1 DEF

A graph used in studying beta decay, in which the square root of the number of beta particles whose momenta(or energy) lie within a certain narrow range, divided by a function worked out by Fermi, is plotted against beta-particle energy...  2, record 4, English, - Kurie%20plot

Record number: 4, Textual support number: 1 OBS

[The Fermi plot] is a straight line for allowed transitions and some forbidden transitions, in accord with the Fermi beta-decay theory.  2, record 4, English, - Kurie%20plot

Record 4,  Textual support,  French

Record number: 4, Textual support number: 1 DEF

Représentation graphique d'un spectre continu bêta.  2, record 4, French, - droite%20de%20Kurie

Record 4,  Textual support,  Spanish

Record 5,  Textual support,  English

Record number: 5, Textual support number: 1 DEF

A directed graph that is a collection of trees. If the root is removed from a tree together with the arcs emanating from that root, the resulting collection of subtrees forms a forest.  2, record 5, English, - forest

Record 5,  Textual support,  French

Record number: 5, Textual support number: 1 DEF

Dans un graphe orienté, collection d'arbres résultant de l'élimination de la racine et des arcs émanant d'elle.  3, record 5, French, - for%C3%AAt

Record number: 5, Textual support number: 1 CONT

Forêt maximale, forêt minimale.  3, record 5, French, - for%C3%AAt

Record 5,  Textual support,  Spanish

Record number: 5, Textual support number: 1 DEF

Conjunto de árboles de directorios.  1, record 5, Spanish, - foresta

Record 6,  Textual support,  English

Record number: 6, Textual support number: 1 DEF

A virtual terminal environment(VTE) that is a complete directed graph of VTE parameters in which all node parameters and terminal leaf parameters implied by all existing nodes from the root of the tree have values.  2, record 6, English, - full%20virtual%20terminal%20environment

Record 6,  Textual support,  French

Record 6,  Textual support,  Spanish

Record number: 6, Textual support number: 1 DEF

Entorno que simula totalmente un terminal directamente conectado a un equipo.  2, record 6, Spanish, - entorno%20de%20terminal%20virtual%20completo