public boolean hasEdge(final Role role) { return hasEdge(null, role, null); }
if (_nodes.get(succ.getName()) != succ) throw new InternalReasonerException("Invalid edge to a non-existing node: " + edge + " " + _nodes.get(succ.getName()) + "(" + _nodes.get(succ.getName()).hashCode() + ")" + succ + "(" + succ.hashCode() + ")"); if (!succ.getInEdges().hasEdge(edge)) throw new InternalReasonerException("Invalid edge: " + edge); if (succ.isMerged())
public boolean hasEdgeFrom(final Individual from) { return hasEdge(from, null, null); }
if (_nodes.get(succ.getName()) != succ) throw new InternalReasonerException("Invalid edge to a non-existing node: " + edge + " " + _nodes.get(succ.getName()) + "(" + _nodes.get(succ.getName()).hashCode() + ")" + succ + "(" + succ.hashCode() + ")"); if (!succ.getInEdges().hasEdge(edge)) throw new InternalReasonerException("Invalid edge: " + edge); if (succ.isMerged())
public boolean hasEdgeFrom(final Individual from) { return hasEdge(from, null, null); }
public final boolean hasRSuccessor(final Role r, final Node x) { return _outEdges.hasEdge(this, r, x); }
public boolean hasEdgeTo(final Node to) { return hasEdge(null, null, to); }
public final boolean hasRSuccessor(final Role r, final Node x) { return _outEdges.hasEdge(this, r, x); }
public boolean hasEdgeTo(final Node to) { return hasEdge(null, null, to); }
public boolean hasEdge(final Role role) { return hasEdge(null, role, null); }
public boolean hasEdge(final Edge e) { return hasEdge(e.getFrom(), e.getRole(), e.getTo()); }
public boolean hasEdge(final Edge e) { return hasEdge(e.getFrom(), e.getRole(), e.getTo()); }
edge = new DefaultEdge(role, subj, obj, ds); if (subj.getOutEdges().hasEdge(edge)) return null;
edge = new DefaultEdge(role, subj, obj, ds); if (subj.getOutEdges().hasEdge(edge)) return null;