An algorithm to find all paths between two sets of nodes in a directed graph, with options to search only simple paths and to limit the path length.
Utility methods working on graph level by means of JGraphT API.
A labeled edge in the graph.
A labeled edge that wraps an OWLProperty object as label.
Wraps an OWL individual with its types.
DL-Learner is licenced under the terms of the GNU General Public License.
Copyright © 2007-2019 Jens Lehmann