for(Node n: graph.vertexSet()) { if(n instanceof SpoutNode) { spoutNodes.add((SpoutNode) n);
@Override public Set<V> vertexSet() { return m_graph.vertexSet(); }
/** * Creates a new object delegating to the given graph. * * @param graph not <code>null</code>, must be empty. */ public DiGraphImpl(DefaultDirectedGraph<V, Edge<V>> graph) { checkNotNull(graph); checkArgument(graph.vertexSet().isEmpty()); m_graph = graph; }
static public <V, E> void addLoops(DefaultDirectedGraph<V, E> target) { for (V vertex : target.vertexSet()) { target.addEdge(vertex, vertex); } }
private void recomputeRootAndLeavesIfDirty() { if (isDirty) { root = null; leaves = new HashSet<V>(); isDirty = false; for (V vertex : tree.vertexSet()) { if (tree.inDegreeOf(vertex)==0) { Verify.verify(root==null, "More than one root in tree."); root = vertex; } if (tree.outDegreeOf(vertex)==0) { leaves.add(vertex); } } } }
for(Node n: graph.vertexSet()) { if(n instanceof SpoutNode) { spoutNodes.add((SpoutNode) n);
logger.debug("Graph Metrics: " + graph.vertexSet().size() + " vertices, " + graph.edgeSet().size() + " edges; based on (at least) " + joinSummaryModel.size() + " triples");
private static DefaultDirectedGraph<DataRangeExpression,DefaultEdge> getDataRangeGraph (OntologyImpl.UnclassifiedOntologyTBox ontology, DefaultDirectedGraph<DataPropertyExpression,DefaultEdge> dataPropertyGraph) { DefaultDirectedGraph<DataRangeExpression,DefaultEdge> dataRangeGraph = new DefaultDirectedGraph<>(DefaultEdge.class); // ranges of roles for (DataPropertyExpression role : dataPropertyGraph.vertexSet()) dataRangeGraph.addVertex(role.getRange()); // edges between the ranges for sub-properties for (DefaultEdge edge : dataPropertyGraph.edgeSet()) { DataPropertyExpression child = dataPropertyGraph.getEdgeSource(edge); DataPropertyExpression parent = dataPropertyGraph.getEdgeTarget(edge); dataRangeGraph.addEdge(child.getRange(), parent.getRange()); } // data range inclusions from the ontology for (BinaryAxiom<DataRangeExpression> clsIncl : ontology.getSubDataRangeAxioms()) { dataRangeGraph.addVertex(clsIncl.getSuper()); // Datatype is not among the vertices from the start dataRangeGraph.addEdge(clsIncl.getSub(), clsIncl.getSuper()); } return dataRangeGraph; }
for (ObjectPropertyExpression role : objectPropertyGraph.vertexSet()) graph.addVertex(role.getDomain()); for (DataPropertyExpression role : dataPropertyGraph.vertexSet()) for (DataSomeValuesFrom dom : role.getAllDomainRestrictions()) graph.addVertex(dom); for (ClassExpression c : graph.vertexSet()) graph.addEdge(c, top);
for (ObjectPropertyExpression role : objectPropertyGraph.vertexSet()) graph.addVertex(role.getDomain()); for (DataPropertyExpression role : dataPropertyGraph.vertexSet()) for (DataSomeValuesFrom dom : role.getAllDomainRestrictions()) graph.addVertex(dom); for (ClassExpression c : graph.vertexSet()) graph.addEdge(c, top);
private static DefaultDirectedGraph<DataRangeExpression,DefaultEdge> getDataRangeGraph (OntologyImpl.UnclassifiedOntologyTBox ontology, DefaultDirectedGraph<DataPropertyExpression,DefaultEdge> dataPropertyGraph) { DefaultDirectedGraph<DataRangeExpression,DefaultEdge> dataRangeGraph = new DefaultDirectedGraph<>(DefaultEdge.class); // ranges of roles for (DataPropertyExpression role : dataPropertyGraph.vertexSet()) dataRangeGraph.addVertex(role.getRange()); // edges between the ranges for sub-properties for (DefaultEdge edge : dataPropertyGraph.edgeSet()) { DataPropertyExpression child = dataPropertyGraph.getEdgeSource(edge); DataPropertyExpression parent = dataPropertyGraph.getEdgeTarget(edge); dataRangeGraph.addEdge(child.getRange(), parent.getRange()); } // data range inclusions from the ontology for (BinaryAxiom<DataRangeExpression> clsIncl : ontology.getSubDataRangeAxioms()) { dataRangeGraph.addVertex(clsIncl.getSuper()); // Datatype is not among the vertices from the start dataRangeGraph.addEdge(clsIncl.getSub(), clsIncl.getSuper()); } return dataRangeGraph; }
for (DataPropertyExpression dpe : graph.vertexSet()) graph.addEdge(dpe, top);
for (DataPropertyExpression dpe : graph.vertexSet()) graph.addEdge(dpe, top);
for (ObjectPropertyExpression ope : graph.vertexSet()) graph.addEdge(ope, top);
for (ObjectPropertyExpression ope : graph.vertexSet()) graph.addEdge(ope, top);