Home > Term: nigsberg bridges problem
nigsberg bridges problem
A path through a graph which starts and ends at the same vertex and includes every edge exactly once.
- Ordklass: noun
- Bransch/domän: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Skapad av
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
