| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Reindent algorithm C, find new max_clique at every possible occasion. | Alex AUVOLAT | 2013-12-08 | 1 | -42/+47 |
| | | |||||
| * | Proposition d'optimisation par rapport aux bitset ? | Alex AUVOLAT | 2013-12-05 | 1 | -0/+8 |
| | | |||||
| * | Ajout du coloryaj au TODO. | Alex AUVOLAT | 2013-12-05 | 1 | -0/+11 |
| | | |||||
| * | Added comment | Alex AUVOLAT | 2013-12-05 | 1 | -4/+4 |
| | | |||||
| * | Improved hamming weight. | Alex Auvolat--bernstein | 2013-12-04 | 1 | -4/+16 |
| | | |||||
| * | Added optimization to algo C. | Alex Auvolat--bernstein | 2013-12-04 | 2 | -2/+3 |
| | | |||||
| * | Merge branch 'master' of /users/13/info/oulamara/Work/AlgoProg-Projet | Alex Auvolat--bernstein | 2013-12-04 | 0 | -0/+0 |
| |\ | |||||
| | * | Merge branch 'master' of ↵ | Mendes Oulamara | 2013-12-04 | 5 | -16/+80 |
| | |\ | | | | | | | | | | /users/13/info/oulamara/Work/../../auvolat/boulot/AlgoProg-Projet | ||||
| | * | | Change meaning of heuritic in the elt_of_set_heur function | Mendes Oulamara | 2013-12-04 | 1 | -2/+2 |
| | | | | |||||
| * | | | Added heuristic. | Alex Auvolat--bernstein | 2013-12-04 | 3 | -4/+1860 |
| | |/ |/| | |||||
| * | | Finished implementation for algorithm C, and corrected bitset bugs. | Alex Auvolat--bernstein | 2013-12-04 | 4 | -9/+48 |
| | | | |||||
| * | | Merge branch 'master' of /users/13/info/oulamara/Work/AlgoProg-Projet | Alex Auvolat--bernstein | 2013-12-04 | 3 | -0/+20 |
| |\| | |||||
| | * | Add heuritic to linked lists | Mendes Oulamara | 2013-12-04 | 1 | -0/+4 |
| | | | |||||
| | * | Add heuritic to bitsets | Mendes Oulamara | 2013-12-04 | 2 | -0/+16 |
| | | | |||||
| * | | Added algorithm C (does not work) | Alex Auvolat--bernstein | 2013-12-04 | 3 | -8/+33 |
| |/ | |||||
| * | Algorithm B works. | Alex Auvolat--bernstein | 2013-12-04 | 5 | -59/+109 |
| | | |||||
| * | fgdfdf | Mendes Oulamara | 2013-12-04 | 1 | -0/+27 |
| | | |||||
| * | Added comment to main.c. | Alex AUVOLAT | 2013-11-28 | 1 | -0/+8 |
| | | |||||
| * | Added .dot file, modified gitignore. | Alex AUVOLAT | 2013-11-28 | 2 | -0/+126 |
| | | |||||
| * | Added option to dump graph as graphwiz ; unexpected segmentation fault appears. | Alex AUVOLAT | 2013-11-28 | 1 | -2/+19 |
| | | |||||
| * | Vrai debug de bitset --' | Mendes Oulamara | 2013-11-28 | 2 | -73/+68 |
| | | |||||
| * | Debug bitsets | Mendes Oulamara | 2013-11-27 | 2 | -16/+40 |
| | | |||||
| * | Added useless flush. | Alex Auvolat--bernstein | 2013-11-25 | 1 | -1/+1 |
| | | |||||
| * | Added a simpla notice when new max clique is found. | Alex Auvolat--bernstein | 2013-11-25 | 1 | -0/+1 |
| | | |||||
| * | Added parser for DIMACS format + some examples. | Alex AUVOLAT | 2013-11-25 | 12 | -4/+148063 |
| | | |||||
| * | Implemented basic algorithm for finding maximum clique... no optimizations. | Alex AUVOLAT | 2013-11-24 | 8 | -8/+203 |
| | | |||||
| * | Added nice comments... | Alex AUVOLAT | 2013-11-18 | 7 | -10/+60 |
| | | |||||
| * | Renamed set_bitset.c to set_bitsets.c | Alex AUVOLAT | 2013-11-18 | 4 | -143/+140 |
| | | |||||
| * | Ajout de l'implémentation des bitsets | Mendes Oulamara | 2013-11-18 | 1 | -0/+136 |
| | | |||||
| * | Finished implementation of sets with linked lists. | Alex AUVOLAT | 2013-11-18 | 6 | -39/+286 |
| | | |||||
| * | Started implementation of sets based on linked lists. | Alex AUVOLAT | 2013-11-18 | 3 | -4/+177 |
| | | |||||
| * | Changed a few files so that it will compile. | Alex AUVOLAT | 2013-11-18 | 7 | -9/+16 |
| | | |||||
| * | sets header | Mendes Oulamara | 2013-11-13 | 5 | -0/+98 |
| | | |||||
| * | héhé | Mendes Oulamara | 2013-11-13 | 1 | -0/+3 |
| | | |||||
| * | First commit. | Alex Auvolat--bernstein | 2013-11-13 | 2 | -0/+6 |
 |
index : AlgoProg-Projet.git | |
| Projet d'Algorithmique et Programmation |
| summaryrefslogtreecommitdiff |