boostorg / boostorg/graph

Maximum Adjacency Search: should unit tests be relaxed to allow multiple correct orderings in the result?

Abierto
#338 0 comentarios 0 reacciones 0 asignados Ver en GitHub
algorithm question
Lenguaje dominante
C++
Estrellas
392
Forks
239
Merge medio
1 d 11 min
PR fusionados (30 d)
20

Descripción

When @daankolthof added more tests to MAS, it occurred to me that different but equally correct implementations of the algorithm might return different orderings when tie-breaking edges with equal weights. I haven't confirmed that this is a real problem, it's just a suspicion.

Assuming I'm right, the principle here is that unit tests should be written to test the implementation against the _specification_, not against itself.

Guía de contribución

Abrir la guía de contribución

Evaluación

Este issue todavía no se ha evaluado.

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.