/** * Build the type. * * @return the type */ public DefaultGraphType build() { return new DefaultGraphType( directed, undirected, allowSelfLoops, allowMultipleEdges, weighted, allowCycles, modifiable); }
@Override public GraphType getType() { return DefaultGraphType.directedSimple(); }
@Override public boolean isMultigraph() { return isAllowingMultipleEdges() && !isAllowingSelfLoops(); }
public PseudoGraphJenaModel(Model model, Property confinementProperty) { this(model, DefaultGraphType.pseudograph(), confinementProperty); }
public PseudoGraphJenaGraph(Graph graph) { this(graph, DefaultGraphType.directedPseudograph()); }
public PseudoGraphJenaModel(Model model) { this(model, DefaultGraphType.pseudograph()); }
public PseudoGraphJenaGraph(Graph graph, Node confinementPredicate) { this(graph, DefaultGraphType.directedPseudograph(), confinementPredicate); }
@Override public boolean isPseudograph() { return isAllowingMultipleEdges() && isAllowingSelfLoops(); }
public OpGraph(Graph jenaGraph, BiMap<Node, Expr> nodeToExpr, BiMap<Node, Quad> nodeToQuad) { super(); this.jenaGraph = jenaGraph; this.nodeToExpr = nodeToExpr; if(isHackMessageLogged) { logger.warn("HACK! Claiming directed simple graph although it might be a pseudo graph - subgraph isomorphism checks may not be exhaustive"); isHackMessageLogged = true; } this.jgraphTGraph = new PseudoGraphJenaGraph(jenaGraph, DefaultGraphType.directedSimple()); }
@Override public boolean isSimple() { return !isAllowingMultipleEdges() && !isAllowingSelfLoops(); }