boostorg / boostorg/graph

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

Ouverte
#338 0 commentaires 0 réactions 0 personnes assignées Voir sur GitHub
algorithm question
Langage dominant
C++
Étoiles
392
Forks
239
Merge moyen
1 j 11 min
PR mergées (30 j)
20

Description

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.

Guide de contribution

Ouvrir le guide de contribution

Évaluation

Cette issue n'a pas encore été évaluée.

Recevez les nouvelles issues par e-mail

Un résumé court des issues GitHub adaptées aux débutants.