org.semanticweb.HermiT.graph.Graph Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of org.semanticweb.hermit Show documentation
Show all versions of org.semanticweb.hermit Show documentation
HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more.
This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers.
The version number of this package is a composite of the HermiT version and a value representing the OWLAPI release it is compatible with. Note that the group id for the upstream HermiT is com.hermit-reasoner, while this fork is released under net.sourceforge.owlapi.
This fork exists to allow HermiT users to use newer OWLAPI versions than the ones supported by the original HermiT codebase.
This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.
The newest version!
/* Copyright 2008, 2009, 2010 by the Oxford University Computing Laboratory
This file is part of HermiT.
HermiT is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
HermiT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with HermiT. If not, see type*/
public class Graph implements Serializable, Cloneable {
private static final long serialVersionUID = 5372948202031042380L;
protected final Set m_elements=new HashSet<>();
protected final Map> m_successorsByNodes=new HashMap<>();
/**
* @param from from
* @param to to
*/
public void addEdge(T from,T to) {
Set successors=m_successorsByNodes.get(from);
if (successors==null) {
successors=new HashSet<>();
m_successorsByNodes.put(from,successors);
}
successors.add(to);
m_elements.add(from);
m_elements.add(to);
}
/**
* @param from from
* @param to to
*/
public void addEdges(T from,Set to) {
Set successors=m_successorsByNodes.get(from);
if (successors==null) {
successors=new HashSet<>();
m_successorsByNodes.put(from,successors);
}
successors.addAll(to);
m_elements.add(from);
m_elements.addAll(to);
}
/**
* @return elements
*/
public Set getElements() {
return m_elements;
}
/**
* @param node node
* @return successors
*/
public Set getSuccessors(T node) {
Set result=m_successorsByNodes.get(node);
if (result==null)
result=Collections.emptySet();
return result;
}
/**
* Transitive close.
*/
public void transitivelyClose() {
List toProcess=new ArrayList<>();
for (Set reachable : m_successorsByNodes.values()) {
toProcess.clear();
toProcess.addAll(reachable);
while (!toProcess.isEmpty()) {
T elementOnPath=toProcess.remove(toProcess.size()-1);
Set elementOnPathSuccessors=m_successorsByNodes.get(elementOnPath);
if (elementOnPathSuccessors!=null)
for (T elementOnPathSuccessor : elementOnPathSuccessors)
if (reachable.add(elementOnPathSuccessor))
toProcess.add(elementOnPathSuccessor);
}
}
}
/**
* @return graph
*/
public Graph getInverse() {
Graph result=new Graph<>();
for (Map.Entry> entry : m_successorsByNodes.entrySet()) {
T from=entry.getKey();
for (T successor : entry.getValue())
result.addEdge(successor,from);
}
return result;
}
@Override
public Graph clone() {
Graph result=new Graph<>();
result.m_elements.addAll( m_elements );
for (Map.Entry> entry : m_successorsByNodes.entrySet()) {
T from=entry.getKey();
for (T successor : entry.getValue())
result.addEdge(from,successor);
}
return result;
}
/**
* @param elements elements
*/
public void removeElements(Set elements) {
for(T element : elements){
m_elements.remove( element );
m_successorsByNodes.remove( element );
}
}
/**
* @param fromNode from
* @param toNode to
* @return true if successor
*/
public boolean isReachableSuccessor(T fromNode,T toNode) {
if (fromNode.equals(toNode))
return true;
Set result=new HashSet<>();
Queue toVisit=new LinkedList<>();
toVisit.add(fromNode);
while (!toVisit.isEmpty()) {
T current=toVisit.poll();
Set successors = getSuccessors(current);
if (successors.contains(toNode))
return true;
if (result.add(current))
toVisit.addAll(successors);
}
return false;
}
/**
* @param fromNode fromNode
* @return reachable successors
*/
public Set getReachableSuccessors(T fromNode) {
Set result = new HashSet<>();
Queue toVisit=new LinkedList<>();
toVisit.add(fromNode);
while (!toVisit.isEmpty()) {
T current=toVisit.poll();
if (result.add(current))
toVisit.addAll(getSuccessors(current));
}
return result;
}
@Override
public String toString() {
StringBuilder buffer=new StringBuilder();
for (T element : m_elements) {
buffer.append(element.toString());
buffer.append(" -> { ");
boolean firstSuccessor=true;
Set successors=m_successorsByNodes.get(element);
if (successors!=null) {
for (T successor : successors) {
if (firstSuccessor)
firstSuccessor=false;
else
buffer.append(", ");
buffer.append(successor.toString());
}
}
buffer.append(" }\n");
}
return buffer.toString();
}
}