net.sansa_stack.inference.rules
RuleDependencyGraph
Related Doc:
package rules
Returns true if there is a cycle in the graph, i.e.
Returns true if there is a cycle in the graph, i.e. either
- there is a path n1 -> n2 -> ... -> n1 or - a loop, i.e. an edge that connects a vertex to itself.
Applies topological sort and returns the resulting layers.
Applies topological sort and returns the resulting layers. Each layer contains its level and a set of rules.
the layers
Returns all nodes that are connected by an edge to itself.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
the set of rules contained in this graph
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
Given a set of rules R, a rule dependency graph (RDG) is a directed graph G = (V, E) such that
The dependency between two rules r_i and r_j, denoted as r_i -> r_j resp. "r_i depends on r_j" indicates that the result r_j is used as input of r_i. In particular, that means we use the same direction in the graph although one would expect to have an edge from the rule r_j producing the data to the rule r_i consuming the data.