Petar, Look up "British Museum Search" - what you want to do has a high computation cost per instance in network objects of almost any useful size. Even if you coded for maximum efficiency, you may not be able to offer such a feature (as a practical matter) for that reason alone. Also, for large (enough) graphs, the process of providing a selection set to the user itself represents a challenge - you might have 100k paths to choose from.
Regards, -mark bobick -----Original Message----- From: Petar Jovanovic [mailto:[email protected]] Sent: Thursday, January 31, 2013 1:10 PM To: [email protected] Subject: how to find multiple paths between classes in the ontology? Hi, I found many threads about finding the shortest path and calculating distance between two nodes in the ontology with Jena (OntTools class to be precise). However, I'm interested to find all the paths between two nodes and then to let user for example choose the one he wants. Is there some method for getting the set of all paths between two classes? Thanks!
