double estimatedTreeSize = 1.0; for (OWLClass owlClass : connectedSet) { estimatedTreeSize *= subgraph.outDegreeOf(owlClass);
double estimatedTreeSize = 1.0; for (OWLClass owlClass : connectedSet) { estimatedTreeSize *= subgraph.outDegreeOf(owlClass);
double estimatedTreeSize = 1.0; for (final OWLClass owlClass : connectedSet) estimatedTreeSize *= subgraph.outDegreeOf(owlClass);
private void estimateTreeSizesForCycles(OptimizedDirectedMultigraph<OWLClass> existentialRestrictionGraph) { int maxSizeOfCompleteGraphToIgnore = getMaxSizeOfCompleteGraphToIgnore(m_MaxTreeSize); StrongConnectivityInspector<OWLClass, DefaultWeightedEdge> connectivityInspector = new StrongConnectivityInspector<OWLClass, DefaultWeightedEdge>(existentialRestrictionGraph); for (Set<OWLClass> connectedSet : connectivityInspector.stronglyConnectedSets()) { if (connectedSet.size() <= maxSizeOfCompleteGraphToIgnore) continue; DirectedSubgraph<OWLClass, DefaultWeightedEdge> subgraph = new DirectedSubgraph<OWLClass, DefaultWeightedEdge>(existentialRestrictionGraph, connectedSet, null); double estimatedTreeSize = 1.0; for (OWLClass owlClass : connectedSet) { estimatedTreeSize *= subgraph.outDegreeOf(owlClass); } if (estimatedTreeSize > m_MaxTreeSize) { Lint lint = m_LintFactory.make(); lint.addAllParticipatingClasses(connectedSet); lint.setSeverity(new Severity(estimatedTreeSize)); m_AccumulatedLints.add(lint); } } }
private void estimateTreeSizesForCycles(OptimizedDirectedMultigraph<OWLClass> existentialRestrictionGraph) { int maxSizeOfCompleteGraphToIgnore = getMaxSizeOfCompleteGraphToIgnore(m_MaxTreeSize); StrongConnectivityInspector<OWLClass, DefaultWeightedEdge> connectivityInspector = new StrongConnectivityInspector<OWLClass, DefaultWeightedEdge>(existentialRestrictionGraph); for (Set<OWLClass> connectedSet : connectivityInspector.stronglyConnectedSets()) { if (connectedSet.size() <= maxSizeOfCompleteGraphToIgnore) continue; DirectedSubgraph<OWLClass, DefaultWeightedEdge> subgraph = new DirectedSubgraph<OWLClass, DefaultWeightedEdge>(existentialRestrictionGraph, connectedSet, null); double estimatedTreeSize = 1.0; for (OWLClass owlClass : connectedSet) { estimatedTreeSize *= subgraph.outDegreeOf(owlClass); } if (estimatedTreeSize > m_MaxTreeSize) { Lint lint = m_LintFactory.make(); lint.addAllParticipatingClasses(connectedSet); lint.setSeverity(new Severity(estimatedTreeSize)); m_AccumulatedLints.add(lint); } } }
private void estimateTreeSizesForCycles(final OptimizedDirectedMultigraph<OWLClass> existentialRestrictionGraph) { final int maxSizeOfCompleteGraphToIgnore = getMaxSizeOfCompleteGraphToIgnore(_maxTreeSize); final StrongConnectivityAlgorithm<OWLClass, DefaultWeightedEdge> connectivityInspector = new KosarajuStrongConnectivityInspector<>(existentialRestrictionGraph); for (final Set<OWLClass> connectedSet : connectivityInspector.stronglyConnectedSets()) { if (connectedSet.size() <= maxSizeOfCompleteGraphToIgnore) continue; final DirectedSubgraph<OWLClass, DefaultWeightedEdge> subgraph = new DirectedSubgraph<>(existentialRestrictionGraph, connectedSet, null); double estimatedTreeSize = 1.0; for (final OWLClass owlClass : connectedSet) estimatedTreeSize *= subgraph.outDegreeOf(owlClass); if (estimatedTreeSize > _maxTreeSize) { final Lint lint = _LintFactory.make(); lint.addAllParticipatingClasses(connectedSet); lint.setSeverity(new Severity(estimatedTreeSize)); _accumulatedLints.add(lint); } } }