Test: some enhancements on the DFS
- 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.
Showing
- lib/sasacore/topology.mli 1 addition, 2 deletionslib/sasacore/topology.mli
- test/Makefile.inc 13 additions, 3 deletionstest/Makefile.inc
- test/async-unison/Makefile 2 additions, 1 deletiontest/async-unison/Makefile
- test/async-unison/p.ml 2 additions, 2 deletionstest/async-unison/p.ml
- test/dfs-list/Makefile 2 additions, 1 deletiontest/dfs-list/Makefile
- test/dfs-list/state.ml 4 additions, 2 deletionstest/dfs-list/state.ml
- test/dfs/Makefile 2 additions, 1 deletiontest/dfs/Makefile
- test/dfs/p.ml 1 addition, 2 deletionstest/dfs/p.ml
- test/dfs/root.ml 1 addition, 2 deletionstest/dfs/root.ml
- test/dfs/state.ml 16 additions, 6 deletionstest/dfs/state.ml
Loading
Please register or sign in to comment