Inicio > 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.
- Parte del discurso: noun
- Industria/ámbito: Ciencia informática
- Categoría: Algoritmos & Estructura de Datos
- Government Agency: NIST
0
Creador
- GeorgeV
-
(Gold) 1123 puntos - 100% positive feedback
