Napačna izbira? Nič za to! Ponujamo možnost vračila v 30 dneh
Z darilnim bonom ne morete zgrešiti. Obdarovanec lahko v zameno za darilni bon izbere karkoli iz naše ponudbe.
30 dni za vračilo blaga
Offers a treatment of spanning tree algorithms, from their role in classical computer science to their modern applications. This book explains the general properties of spanning trees. It explores several other spanning trees, including maximum leaf spanning trees, minimum diameter spanning trees, Steiner trees, and evolutionary trees.