-
### What is the expected enhancement?
Implementing a transitive closure function with similar functionality to the one in Networkx:
https://networkx.org/documentation/stable/reference/algorithms…
-
Behaviour: Schulze method/transitive closure;implements the Floyd-Warshall algorithm
@tested_feature("Schulze method")
@tested_operation("transitive closure")
@tested_behaviour("implements t…
-
Something about transitive closures (I think we need to build a dependency graph between tables)
-
We want to implement transitive closure on graphs. This may require change the graph structure to use an adjacency list
-
Add additional processing step (with tests, readme description etc) to compute the TC of those three graphs, create plots for vertex and edge counts.
-
In QP inference, we are always asking (isA(A, B)) which means, in theory, a recursive walk up transitive closure on A, looking for B, which means a lot of round trips to the database.
It's possible…
-
Hi, I wonder if anyone can help with the following errors. I run SODA with one master and two slave nodes, and all with scalable SGX.
> name@master:~/soda/bin$ sudo ./app
> 15:34:24 [ INFO] starti…
-
Hey again, I am working with the last version of cvc4 that works with windows 10.
In the following code, if I don't comment out the line(or any other line in this block),
```SMT
;(mkTuple 1 9) …
-
Objects can only be cyclic garbage if they are not reachable.
So, if we can cheaply identify the majority of reachable objects before performing the (relatively slow) cycle detecting pass, we can sav…
-
Given a tree structure using one or more predicates (e.g., `isa`, `subclass`), compute the transitive closure and generate new KGTK edges that flatten the tree.