public interface GraphOfRuleDependencies
Modifier and Type | Method and Description |
---|---|
boolean |
existUnifier(Rule src,
Rule dest)
Returns true, if there exists an unifier from src to dest, false otherwise.
|
Iterable<Rule> |
getRules() |
StronglyConnectedComponentsGraph<Rule> |
getStronglyConnectedComponentsGraph() |
GraphOfRuleDependencies |
getSubGraph(Iterable<Rule> ruleSet)
Creates and return an induced SubGraph of the current one.
|
Set<Rule> |
getTriggeredRules(Rule src)
Returns all rules that can be triggered by the specified one.
|
Set<org.apache.commons.lang3.tuple.Pair<Rule,Substitution>> |
getTriggeredRulesWithUnifiers(Rule src)
Returns all pair of rule and unifier that can be triggered by the specfied rule.
|
Set<Substitution> |
getUnifiers(Rule src,
Rule dest)
Returns a set of Substitution representing the set of unifiers from src to dest.
|
boolean |
hasCircuit()
Performs cycle detection on the
GraphOfRuleDependencies . |
boolean existUnifier(Rule src, Rule dest)
src
- dest
- Set<Substitution> getUnifiers(Rule src, Rule dest)
src
- dest
- Set<Rule> getTriggeredRules(Rule src)
src
- a Rule.Set<org.apache.commons.lang3.tuple.Pair<Rule,Substitution>> getTriggeredRulesWithUnifiers(Rule src)
src
- boolean hasCircuit()
GraphOfRuleDependencies
.GraphOfRuleDependencies getSubGraph(Iterable<Rule> ruleSet)
ruleSet
- Iterable<Rule> getRules()
GraphOfRuleDependencies
.StronglyConnectedComponentsGraph<Rule> getStronglyConnectedComponentsGraph()
Copyright © 2014–2018 GraphIK (INRIA - LIRMM). All rights reserved.