Name | Description | Type | Package | Framework |
BFS | Breadth First Search (BFS) is an iterative graph traversal primitive. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
BFS .Bindings | Additional IBindingExtractor. | Interface | com.bigdata.rdf.graph.analytics | BlazeGraph |
BFS .ES | Edge state is not used. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
BFS .VS | Class | com.bigdata.rdf.graph.analytics | BlazeGraph | |
CC | Connected components computes the distinct sets of non-overlapping subgraphs within a graph. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
CC .Bindings | Additional IBindingExtractor. | Interface | com.bigdata.rdf.graph.analytics | BlazeGraph |
CC .ES | Edge state is not used. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
CC .VS | Class | com.bigdata.rdf.graph.analytics | BlazeGraph | |
FuzzySSSP | This algorithm provides a fuzzy implementation of the shortest paths between a set of source vertices and a set of target vertices. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
PR | Page rank assigns weights to the vertices in a graph based by on the relative "importance" as determined by the patterns of directed links in the graph. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
PR .Bindings | Additional IBindingExtractor. | Interface | com.bigdata.rdf.graph.analytics | BlazeGraph |
PR .ES | Edge state is not used. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
PR .VS | Class | com.bigdata.rdf.graph.analytics | BlazeGraph | |
SSSP | SSSP (Single Source, Shortest Path). | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
SSSP .Bindings | Additional IBindingExtractor. | Interface | com.bigdata.rdf.graph.analytics | BlazeGraph |
SSSP .ES | Edge state is not used. | Class | com.bigdata.rdf.graph.analytics | BlazeGraph |
SSSP .VS | Class | com.bigdata.rdf.graph.analytics | BlazeGraph | |