Merge pull request #243 from BjarkeHautop/remove-build-mentions

Author: frederikfabriciusbjerre

.github/copilot-instructions.md

@@ -89,10 +89,9 @@ caugi/
 ### Making Changes
 
 1. **Minimal changes**: Make the smallest possible changes to accomplish the goal
-2. **Lazy building**: Remember that graph mutations are batched - test both before and after explicit `build()` calls
-3. **Edge registry**: Be careful when modifying the edge registry system
-4. **Backward compatibility**: Maintain API compatibility when possible
-5. **Update NEWS.md**: Add entries to `NEWS.md` for user-facing changes under the appropriate section:
+2. **Edge registry**: Be careful when modifying the edge registry system
+3. **Backward compatibility**: Maintain API compatibility when possible
+4. **Update NEWS.md**: Add entries to `NEWS.md` for user-facing changes under the appropriate section:
    - **New Features**: New functions, methods, or capabilities
    - **Improvements**: Enhancements to existing functionality, performance, or documentation
    - **Bug Fixes**: Corrections to existing behavior

README.Rmd

@@ -112,7 +112,7 @@ We expect this feature to be needing further polishing in future releases, and w
 
 `caugi` graphs are represented in a compact Compressed Sparse Row (CSR) format in Rust. `caugi` works with a front-loading philosophy. Since the `caugi` graph is stored in a CSR format, mutations of the graph is computationally expensive compared to other graph storage systems, _but_ it allows for very fast querying. Additionally to the storage format of the graph itself, `caugi` also stores additional information about node relations in such a way that it allows for faster queries without blowing up the object too much.
 
-To accommodate for the cost of mutations, `caugi` graphs are built lazily. This means that when you mutate the graph, for example by adding edges to it, the graph edits are stored in R, but not in Rust. When you then need to query the graphs, the graph will rebuild itself in Rust, and the query will be executed on the newly built graph. You can also use the `build(cg)` function to force building the graph in Rust at any time.
+To accommodate for the cost of mutations, `caugi` graphs are built lazily, but you can force a build by using the function `build()`.
 
 ## Why?
 It's fast, _dawg_ 🐶 See the [vignette on performance](https://caugi.org/articles/performance.html) for benchmarks.

README.md

@@ -100,7 +100,7 @@ register_caugi_edge(
 )
 
 caugi(A %-->% B, B %<--% C, class = "DAG")
-#> <caugi object; 3 nodes, 2 edges; simple: TRUE; session=0x5679606fdb60>
+#> <caugi object; 3 nodes, 2 edges; simple: TRUE; session=0x000001a2318f5e90>
 #>   graph_class: DAG
 #>   nodes: A, B, C
 #>   edges: A-->B, B<--C
@@ -136,12 +136,7 @@ relations in such a way that it allows for faster queries without
 blowing up the object too much.
 
 To accommodate for the cost of mutations, `caugi` graphs are built
-lazily. This means that when you mutate the graph, for example by adding
-edges to it, the graph edits are stored in R, but not in Rust. When you
-then need to query the graphs, the graph will rebuild itself in Rust,
-and the query will be executed on the newly built graph. You can also
-use the `build(cg)` function to force building the graph in Rust at any
-time.
+lazily, but you can force a build by using the function `build()`.
 
 ## Why?