summaryrefslogtreecommitdiff
Commit message (Expand)AuthorAgeFilesLines
* Suppression de la non-implémentation utilisant des tarbresAlex AUVOLAT2013-12-083-43/+2
* Rien.Alex AUVOLAT2013-12-081-1/+2
* RienAlex AUVOLAT2013-12-083-24/+0
* Improved coloringAlex AUVOLAT2013-12-081-15/+27
* Rien du tout, on a juste un coloriage correct maintenant.Alex AUVOLAT2013-12-083-9/+19
* Nouvelle condition de coloriageAlex AUVOLAT2013-12-084-6/+999873
* Added size 84 test case.Alex AUVOLAT2013-12-081-0/+3163
* Improved bitset implementationAlex AUVOLAT2013-12-082-63/+65
* Ajout de l'heuristique de coloriage.Alex AUVOLAT2013-12-081-0/+103
* Correction d'un bug relativement majeur.Alex AUVOLAT2013-12-082-6/+8
* Merge branch 'master' of sas.eleves.ens.fr:/users/13/info/oulamara/Work/AlgoP...Alex AUVOLAT2013-12-085-22/+50
|\
| * Addition of sets_equal to bitsetsMendes Oulamara2013-12-065-23/+51
| * Merge branch 'master' of /users/13/info/oulamara/Work/../../auvolat/boulot/Al...Mendes Oulamara2013-12-053-6/+19
| |\
| * \ Merge branch 'master' of /users/13/info/oulamara/Work/../../auvolat/boulot/Al...Mendes Oulamara2013-12-040-0/+0
| |\ \
| * \ \ Merge branch 'master' of /users/13/info/oulamara/Work/../../auvolat/boulot/Al...Mendes Oulamara2013-12-042-2/+1858
| |\ \ \
* | | | | Reindent algorithm C, find new max_clique at every possible occasion.Alex AUVOLAT2013-12-081-42/+47
* | | | | Proposition d'optimisation par rapport aux bitset ?Alex AUVOLAT2013-12-051-0/+8
* | | | | Ajout du coloryaj au TODO.Alex AUVOLAT2013-12-051-0/+11
| |_|_|/ |/| | |
* | | | Added commentAlex AUVOLAT2013-12-051-4/+4
* | | | Improved hamming weight.Alex Auvolat--bernstein2013-12-041-4/+16
* | | | Added optimization to algo C.Alex Auvolat--bernstein2013-12-042-2/+3
| |_|/ |/| |
* | | Merge branch 'master' of /users/13/info/oulamara/Work/AlgoProg-ProjetAlex Auvolat--bernstein2013-12-040-0/+0
|\| | | |/ |/|
| * Merge branch 'master' of /users/13/info/oulamara/Work/../../auvolat/boulot/Al...Mendes Oulamara2013-12-045-16/+80
| |\
| * | Change meaning of heuritic in the elt_of_set_heur functionMendes Oulamara2013-12-041-2/+2
* | | Added heuristic.Alex Auvolat--bernstein2013-12-043-4/+1860
| |/ |/|
* | Finished implementation for algorithm C, and corrected bitset bugs.Alex Auvolat--bernstein2013-12-044-9/+48
* | Merge branch 'master' of /users/13/info/oulamara/Work/AlgoProg-ProjetAlex Auvolat--bernstein2013-12-043-0/+20
|\|
| * Add heuritic to linked listsMendes Oulamara2013-12-041-0/+4
| * Add heuritic to bitsetsMendes Oulamara2013-12-042-0/+16
* | Added algorithm C (does not work)Alex Auvolat--bernstein2013-12-043-8/+33
|/
* Algorithm B works.Alex Auvolat--bernstein2013-12-045-59/+109
* fgdfdfMendes Oulamara2013-12-041-0/+27
* Added comment to main.c.Alex AUVOLAT2013-11-281-0/+8
* Added .dot file, modified gitignore.Alex AUVOLAT2013-11-282-0/+126
* Added option to dump graph as graphwiz ; unexpected segmentation fault appears.Alex AUVOLAT2013-11-281-2/+19
* Vrai debug de bitset --'Mendes Oulamara2013-11-282-73/+68
* Debug bitsetsMendes Oulamara2013-11-272-16/+40
* Added useless flush.Alex Auvolat--bernstein2013-11-251-1/+1
* Added a simpla notice when new max clique is found.Alex Auvolat--bernstein2013-11-251-0/+1
* Added parser for DIMACS format + some examples.Alex AUVOLAT2013-11-2512-4/+148063
* Implemented basic algorithm for finding maximum clique... no optimizations.Alex AUVOLAT2013-11-248-8/+203
* Added nice comments...Alex AUVOLAT2013-11-187-10/+60
* Renamed set_bitset.c to set_bitsets.cAlex AUVOLAT2013-11-184-143/+140
* Ajout de l'implémentation des bitsetsMendes Oulamara2013-11-181-0/+136
* Finished implementation of sets with linked lists.Alex AUVOLAT2013-11-186-39/+286
* Started implementation of sets based on linked lists.Alex AUVOLAT2013-11-183-4/+177
* Changed a few files so that it will compile.Alex AUVOLAT2013-11-187-9/+16
* sets headerMendes Oulamara2013-11-135-0/+98
* héhéMendes Oulamara2013-11-131-0/+3
* First commit.Alex Auvolat--bernstein2013-11-132-0/+6
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-24 14:17:26 +0000