boostorg / boostorg/graph

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

Open
#338 0 comments 0 reactions 0 assignees View on GitHub
algorithm question
Dominant language
C++
Stars
392
Forks
239
Avg merge
1d 11m
Merged PRs (30d)
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.

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.