Accueil >  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.

0 0

Créateur

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.