Skip to content
Snippets Groups Projects
  1. Jan 27, 2020
  2. Oct 31, 2019
  3. Oct 23, 2019
  4. Oct 17, 2019
    • erwan's avatar
      Test: some enhancements on the DFS · 792cbed1
      erwan authored
      - do not hard-code the size of the graph in the ml files
      - do not print the whole state of big graphs. Indeed, for graphs of
        10000 nodes, if we print the path (which is itself an array of size 10000)
        we obtain 100 000 000 variables, which is too much for the rif file.
      792cbed1
  5. Oct 08, 2019
  6. Oct 07, 2019
  7. Sep 18, 2019
  8. Sep 06, 2019
    • erwan's avatar
      Build: set-up opam files · 3ab0b340
      erwan authored
      To do that, I've reorganized the code
      
      Test: with ocaml 4.08, it is impossible to load the same function twice.
      Hence the need to define p.mli files for graphs with several nodes.
      
      Also, track missing files and the alea-coloring exemples.
      3ab0b340
  9. Jul 11, 2019
    • erwan's avatar
      Test: fix the coloring oracle · 42ccc7fd
      erwan authored
      - the move_count node was wrong (missing parenthesis)
      - the lemma an the theorem only holds for locally central unfait demon
      2.10.3
      42ccc7fd
  10. Jul 08, 2019
  11. Jul 05, 2019
  12. Jun 20, 2019
  13. Jun 19, 2019
  14. May 23, 2019
  15. May 16, 2019
  16. May 15, 2019
  17. May 14, 2019
  18. Apr 30, 2019
  19. Mar 28, 2019
  20. Mar 27, 2019
  21. Mar 26, 2019
  22. Mar 22, 2019
  23. Mar 14, 2019
  24. Mar 10, 2019
  25. Mar 09, 2019
    • erwan's avatar
      Add a neighbor type in algo local vars. · f43f69b9
      erwan authored
      Also add the list of neighbors to the init function. The rationale is that
      to give a sensible initial value to local vars of type 'Neighbor', we need
      the neighbors number.
      
      I could have chosen to pass an integer only. Well, who can the plus
      can the minus.
      f43f69b9
  26. Mar 07, 2019
Loading