Gitbistex
Team AMACC
Git Bistex: Design Your Algorithm
During software development, developers collaborate by working on different parts of the code and regularly committing their changes to a version control system. The collection of versions and their relationships form a graph. When a developer identifies a bug in the software, it is helpful to determine when the bug first appeared to focus the analysis only on the code added at that time. However, testing whether a particular version contains the bug can be time-consuming. Therefore, minimizing the number of versions to test is essential.
In this demo, you will be presented with several graphs representing versions of a software. Your goal is to identify the first version containing the bug by testing as few versions as possible. Multiple difficulty levels will challenge your search strategy (i.e., your algorithm).
Contributors
Julien Courtiel, Paul Dorbec, Romain Lecoq, Clément Maganza