Tree
CHF 56.95
Auf Lager
SKU
2I1DBAHB53T
1 Verfügbar 
Kostenloser Versand
Geliefert zwischen Mo., 03.11.2025 und Di., 04.11.2025
Details
High Quality Content by WIKIPEDIA articles! In mathematics, more specifically graph theory, a tree is a 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 trees used as data structures in computer science are not really trees in this sense, but rather, types of ordered directed trees; see below.A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of vertices. A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or its edges may be directed from one vertex to another; see graph (mathematics) for more detailed definitions and for other variations in the types of graphs that are commonly considered.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130334062
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T8mm
- Jahr 2010
- EAN 9786130334062
- Format Kartonierter Einband
- ISBN 978-613-0-33406-2
- Titel Tree
- Untertitel Graph Theory, Connectedness, Disjoint Union, Tree (data structure), Data structure, Cycle (graph theory), Decision Tree, Pseudoforest, Tree Structure, Graph (mathematics), Indicator Function
- Gewicht 213g
- Herausgeber Betascript Publishers
- Anzahl Seiten 132
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
