[Bigdata-commit] SF.net SVN: bigdata:[7862] branches/RDR/bigdata-rdf/src/java/com/bigdata/ rdf/graph/impl/bd/GASService.java

[<tho...@us...>]

Revision: 7862
          http://sourceforge.net/p/bigdata/code/7862
Author:   thompsonbry
Date:     2014-02-20 21:14:56 +0000 (Thu, 20 Feb 2014)
Log Message:
-----------
javadoc

Modified Paths:
--------------
    branches/RDR/bigdata-rdf/src/java/com/bigdata/rdf/graph/impl/bd/GASService.java

Modified: branches/RDR/bigdata-rdf/src/java/com/bigdata/rdf/graph/impl/bd/GASService.java
===================================================================
--- branches/RDR/bigdata-rdf/src/java/com/bigdata/rdf/graph/impl/bd/GASService.java	2014-02-20 21:14:41 UTC (rev 7861)
+++ branches/RDR/bigdata-rdf/src/java/com/bigdata/rdf/graph/impl/bd/GASService.java	2014-02-20 21:14:56 UTC (rev 7862)
@@ -82,12 +82,12 @@
  * PREFIX gas <http://www.bigdata.com/rdf/gas#>
  * #...
  * SERVICE &lt;GAS&gt; {
- *    gas:program gas:gasClass "com.bigdata.rdf.graph.analytics.BFS"
- *    gas:program gas:in &lt;IRI&gt; # one or more times, specifies the initial frontier.
- *    gas:program gas:out ?out # exactly once - will be bound to the visited vertices.
- *    gas:program gas:maxIterations 4 # optional limit on breadth first expansion.
- *    gas:program gas:maxVisited 2000 # optional limit on the #of visited vertices.
- *    gas:program gas:nthreads 4 # specify the #of threads to use (optional)
+ *    gas:program gas:gasClass "com.bigdata.rdf.graph.analytics.BFS" .
+ *    gas:program gas:in &lt;IRI&gt; . # one or more times, specifies the initial frontier.
+ *    gas:program gas:out ?out . # exactly once - will be bound to the visited vertices.
+ *    gas:program gas:maxIterations 4 . # optional limit on breadth first expansion.
+ *    gas:program gas:maxVisited 2000 . # optional limit on the #of visited vertices.
+ *    gas:program gas:nthreads 4 . # specify the #of threads to use (optional)
  * }
  * </pre>
  * 
@@ -97,12 +97,12 @@
  * PREFIX gas <http://www.bigdata.com/rdf/gas#>
  * #...
  * SERVICE &lt;GAS&gt; {
- *    gas:program gas:gasClass "com.bigdata.rdf.graph.analytics.FuzzySSSP"
- *    gas:program gas:in &lt;IRI&gt; # one or more times, specifies the initial frontier.
- *    gas:program gas:target &lt;IRI&gt; # one or more times, identifies the target vertices and hence the paths of interest.
- *    gas:program gas:out ?out # exactly once - will be bound to the visited vertices laying within N-hops of the shortest paths.
- *    gas:program gas:maxIterations 4 # optional limit on breadth first expansion.
- *    gas:program gas:maxVisited 2000 # optional limit on the #of visited vertices.
+ *    gas:program gas:gasClass "com.bigdata.rdf.graph.analytics.FuzzySSSP" .
+ *    gas:program gas:in &lt;IRI&gt; . # one or more times, specifies the initial frontier.
+ *    gas:program gas:target &lt;IRI&gt; . # one or more times, identifies the target vertices and hence the paths of interest.
+ *    gas:program gas:out ?out . # exactly once - will be bound to the visited vertices laying within N-hops of the shortest paths.
+ *    gas:program gas:maxIterations 4 . # optional limit on breadth first expansion.
+ *    gas:program gas:maxVisited 2000 . # optional limit on the #of visited vertices.
  * }
  * </pre>
  * 
@@ -114,8 +114,16 @@
  * 
  * TODO The input frontier could be a variable, in which case we would pull out
  * the column for that variable rather than running the algorithm once per
- * source binding set, right?  Or maybe not.
+ * source binding set, right? Or maybe not.
  * 
+ * TODO Allow {@link IReducer} that binds the visited vertex and also the
+ * dynamic state associated with that vertex. For BFS and SSSP, this could be
+ * depth/distance and the predecessor (for path information). For BFS and SSSP,
+ * we could also have a specific target vertex (or vertices) and then report out
+ * the path for that vertex/vertices. This would significantly reduce the data
+ * reported back. (Could we run SSSP in both directions to accelerate the
+ * convergence?)
+ * 
  * TODO Also support export. This could be easily done using a SPARQL SELECT
  * 
  * <pre>
@@ -655,6 +663,7 @@
                     
                 }
 
+                // Run the analytic.
                 final IGASStats stats = (IGASStats) gasContext.call();
 
                 if (log.isInfoEnabled()) {

This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.