Fix tests and operation cache

README.md

@@ -2,7 +2,31 @@
 
 Directed Acyclic Graph optimization for QED
 
-## Generate Operations from chains
+## Usage
+
+Instantiate the project first:
+
+`julia --project -e 'import Pkg; Pkg.instantiate()'`
+
+### Run Tests
+
+To run all tests, run
+
+`julia --project=. -e 'import Pkg; Pkg.test()'`
+
+### Run Examples
+
+Get the correct environment for the examples folder:
+
+`julia --project=examples -e 'import Pkg; Pkg.develop("."); Pkg.instantiate()'`
+
+Then execute a specific example:
+
+`julia --project=examples examples/<file>.jl`
+
+## Concepts
+
+### Generate Operations from chains
 
 We assume we have a (valid) graph given. We can generate all initially possible graph operations from it, and we can calculate the graph properties like compute effort and total data transfer.
 
@@ -121,3 +145,5 @@ Graph:
   Graph size in memory: 225.0625 KiB
   286.583 μs (13996 allocations: 804.48 KiB)
 ```
+
+