<span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> (tsz. <span class="searchmatch">spanning</span> trees) (informatika) feszítőfa A <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> (magyarul: feszítőfa) egy olyan alapvető fogalom a gráfelméletben, amely fontos...
Per VLAN <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> (tsz. Per VLAN <span class="searchmatch">Spanning</span> Trees) (informatika) ? Per VLAN <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> - Szótár.net (en-hu) Per VLAN <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> - Sztaki (en-hu)...
Euclidean minimum <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> (tsz. Euclidean minimum <span class="searchmatch">spanning</span> trees) (matematika) euklideszi minimális feszítőfa Euclidean minimum <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> - Szótár.net...
Multiple <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol (tsz. Multiple <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocols) (informatika) A Multiple <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol ( MSTP ) és algoritmus egyszerű...
<span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol (tsz. <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocols) (informatika) A <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol (röviden: STP) egy hálózati protokoll, amelynek célja, hogy...
minimum <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> problem (tsz. minimum <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> problems) (informatika) A Minimum <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> (MST) Problem egy alapvető gráfelméleti optimalizációs...
minimum <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> (tsz. minimum <span class="searchmatch">spanning</span> trees) (informatika) minimális feszítőfa A minimális feszítőfa (angolul: Minimum <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span>, röviden MST)...
Rapid <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol (tsz. Rapid <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocols) (informatika) 2001-ben az IEEE bevezette a Rapid <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol-t (RSTP) IEEE...
IPA: [ ˈfɛsiːtøːfɒ] feszítőfa (matematika, gráfelmélet) angol: <span class="searchmatch">spanning</span> <span class="searchmatch">tree</span> (en) német: spannender Baum (de), Spannbaum orosz: остовное дерево (ru) (ostovnoje...
egy alapvető adatstruktúra, amelyet az IEEE 802.1D szabvány szerinti <span class="searchmatch">Spanning</span> <span class="searchmatch">Tree</span> Protocol (STP) használ. A BPDU-k kulcsfontosságú szerepet játszanak...