Implementation of the Pairwise Shortest Path example PACT program. The program implements one iteration of the algorithm and must be run multiple times until no changes are computed. The pairwise shortest path algorithm comes from the domain graph problems. The goal is to find all shortest paths between any two transitively connected nodes in a graph. In this implementation edges are interpreted as directed and weighted. For the first iteration, the program allows two input formats: 1) RDF triples with foaf:knows predicates. A triple is interpreted as an edge from the RDF subject to the RDF object with weight 1. 2) The programs text-serialization for paths (see @see PathInFormat and @see PathOutFormat). The RDF input format is used if the 4th parameter of the getPlan() method is set to "true". If set to "false" the path input format is used.
Implementation of the Pairwise Shortest Path example PACT program. The program implements one iteration of the algorithm and must be run multiple times until no changes are computed. The pairwise shortest path algorithm comes from the domain graph problems. The goal is to find all shortest paths between any two transitively connected nodes in a graph. In this implementation edges are interpreted as directed and weighted. For the first iteration, the program allows two input formats: 1) RDF triples with foaf:knows predicates. A triple is interpreted as an edge from the RDF subject to the RDF object with weight 1. 2) The programs text-serialization for paths (see @see PathInFormat and @see PathOutFormat). The RDF input format is used if the 4th parameter of the getPlan() method is set to "true". If set to "false" the path input format is used.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.