| Package | Description |
|---|---|
| oracle.pg.common |
This package contains the common logic that is shared by all the backend databases including
Oracle Database, Oracle NoSQL Database, and Apache HBase.
|
| oracle.pgx.api |
This package contains the main Java APIs.
|
| oracle.pgx.api.graphalteration |
| Modifier and Type | Method and Description |
|---|---|
java.util.List<org.apache.tinkerpop.gremlin.structure.Vertex> |
OraclePropertyGraphBase.getShortestPath(PgxGraph g,
java.lang.Long startVertexID,
java.lang.Long endVertexID,
java.lang.String weightPropertyName,
java.util.List<java.lang.Double> weights)
Finds a shortest path between two vertices using a PGX in-memory
analytics.
|
java.util.List<org.apache.tinkerpop.gremlin.structure.Vertex> |
OraclePropertyGraphBase.getShortestPath(PgxGraph g,
org.apache.tinkerpop.gremlin.structure.Vertex start,
org.apache.tinkerpop.gremlin.structure.Vertex end,
java.lang.String weightPropertyName,
java.util.List<java.lang.Double> weights)
Finds a shortest path between two vertices using a PGX in-memory
analytics.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BipartiteGraph
A bipartite
PgxGraph. |
| Modifier and Type | Method and Description |
|---|---|
PgxGraph |
FlashbackSynchronizer.apply() |
PgxGraph |
Synchronizer.apply()
Applies the changes to the underlying PGX graph.
|
PgxGraph |
GraphBuilderImpl.build() |
PgxGraph |
GraphBuilder.build()
Blocking version of
GraphBuilder.buildAsync(). |
PgxGraph |
GraphBuilderImpl.build(java.lang.String newGraphName) |
PgxGraph |
GraphBuilder.build(java.lang.String newGraphName)
Blocking version of
GraphBuilder.buildAsync(String). |
default PgxGraph |
GraphChangeSet.buildNewSnapshot()
Blocking version of
GraphChangeSet.buildNewSnapshotAsync(). |
PgxGraph |
PgxGraph.clone()
Blocking version of
cloneAsync(). |
PgxGraph |
PgxGraph.clone(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
java.lang.String newGraphName)
Blocking version of
cloneAsync(). |
PgxGraph |
PgxGraph.clone(java.lang.String newGraphName)
Blocking version of
cloneAsync(String). |
PgxGraph |
PgxGraph.cloneAndExecutePgql(java.lang.String pgqlString)
(BETA) Blocking version of
cloneAndExecutePgqlAsync(String). |
PgxGraph |
PgxGraph.cloneAndExecutePgql(java.lang.String pgqlString,
java.lang.String graphName)
(BETA) Blocking version of
cloneAndExecutePgqlAsync(String, String). |
PgxGraph |
PgxSession.createGraphFromFrames(java.lang.String graphName,
oracle.pgx.api.beta.frames.PgxFrame vertexFrame,
oracle.pgx.api.beta.frames.PgxFrame edgeFrame)
Creates an homogeneous graph from the specified frames that represent the vertices and edges of the graph.
|
PgxGraph |
PgxGraph.filter(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
GraphFilter graphFilter,
java.lang.String newGraphName)
Blocking version of
filterAsync(Collection, Collection, GraphFilter, String). |
PgxGraph |
PgxGraph.filter(GraphFilter graphFilter)
Blocking version of
filterAsync(GraphFilter). |
PgxGraph |
PgxGraph.filter(GraphFilter graphFilter,
java.lang.String newGraphName)
Blocking version of
filterAsync(GraphFilter, String). |
PgxGraph |
PgxEntity.getGraph()
Gets the graph.
|
PgxGraph |
Scalar.getGraph()
Gets the graph the scalar is bound to.
|
PgxGraph |
PgxCollection.getGraph()
Gets the graph.
|
PgxGraph |
PgxMap.getGraph()
Gets the PgxGraph this map is bound to.
|
PgxGraph |
Property.getGraph()
Gets the graph.
|
PgxGraph |
Partition.getGraph()
Gets the graph.
|
PgxGraph |
PgqlResultSet.getGraph()
Gets the graph of this result set.
|
PgxGraph |
PgxPath.getGraph()
Gets the PgxGraph the Path is defined on.
|
PgxGraph |
AllPaths.getGraph()
Gets the graph.
|
PgxGraph |
PgxSession.getGraph(Namespace namespace,
java.lang.String name)
Blocking version of
PgxSession.getGraphAsync(String). |
PgxGraph |
PgxSession.getGraph(java.lang.String name)
Blocking version of
PgxSession.getGraphAsync(String). |
PgxGraph |
PgxSession.readGraphAsOf(GraphConfig config,
GraphMetaData metaData)
Blocking version of
PgxSession.readGraphAsOfAsync(GraphConfig, GraphMetaData). |
PgxGraph |
PgxSession.readGraphAsOf(GraphConfig config,
GraphMetaData metaData,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphAsOfAsync(GraphConfig, GraphMetaData, String). |
PgxGraph |
PgxSession.readGraphAsOf(GraphConfig config,
long creationTimestamp)
Blocking version of
PgxSession.readGraphAsOfAsync(GraphConfig, long). |
PgxGraph |
PgxSession.readGraphAsOf(GraphConfig config,
long creationTimestamp,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphAsOfAsync(GraphConfig, long, String). |
PgxGraph |
PgxSession.readGraphFile(java.lang.String path)
Blocking version of
PgxSession.readGraphFileAsync(String). |
PgxGraph |
PgxSession.readGraphFile(java.lang.String path,
Format format)
Blocking version of
PgxSession.readGraphFileAsync(String, Format). |
PgxGraph |
PgxSession.readGraphFile(java.lang.String path,
Format format,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFileAsync(String, Format, String). |
PgxGraph |
PgxSession.readGraphFile(java.lang.String path,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFileAsync(String, String). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> filePaths)
Blocking version of
PgxSession.readGraphFilesAsync(List). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> filePaths,
Format format)
Blocking version of
PgxSession.readGraphFilesAsync(List, Format). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> filePaths,
Format format,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFilesAsync(List, String). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths)
Blocking version of
PgxSession.readGraphFilesAsync(List, List). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format)
Blocking version of
PgxSession.readGraphFilesAsync(List, List, Format). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFilesAsync(List, List, Format, String). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFilesAsync(List, List, String). |
PgxGraph |
PgxSession.readGraphFiles(java.util.List<java.lang.String> filePaths,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFilesAsync(List, String). |
PgxGraph |
PgxSession.readGraphFiles(java.lang.String vertexFilePath,
java.lang.String edgeFilePath)
Blocking version of
PgxSession.readGraphFilesAsync(String, String). |
PgxGraph |
PgxSession.readGraphFiles(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format)
Blocking version of
PgxSession.readGraphFilesAsync(String, String, Format). |
PgxGraph |
PgxSession.readGraphFiles(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFilesAsync(String, String, Format, String). |
PgxGraph |
PgxSession.readGraphFiles(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphFilesAsync(String, String, String). |
PgxGraph |
PgxSession.readGraphWithProperties(GraphConfig config)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(GraphConfig). |
PgxGraph |
PgxSession.readGraphWithProperties(GraphConfig config,
boolean updateIfNotFresh)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(GraphConfig, boolean). |
PgxGraph |
PgxSession.readGraphWithProperties(GraphConfig config,
boolean updateIfNotFresh,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(GraphConfig, boolean, String). |
PgxGraph |
PgxSession.readGraphWithProperties(GraphConfig config,
long maxAge,
java.util.concurrent.TimeUnit maxAgeTimeUnit)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(GraphConfig, long, TimeUnit). |
PgxGraph |
PgxSession.readGraphWithProperties(GraphConfig config,
long maxAge,
java.util.concurrent.TimeUnit maxAgeTimeUnit,
boolean blockIfFull,
java.lang.String newGraphName)
|
PgxGraph |
PgxSession.readGraphWithProperties(GraphConfig config,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(GraphConfig, String). |
PgxGraph |
PgxSession.readGraphWithProperties(java.lang.String path)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(String). |
PgxGraph |
PgxSession.readGraphWithProperties(java.lang.String path,
java.lang.String newGraphName)
Blocking version of
PgxSession.readGraphWithPropertiesAsync(String, String). |
PgxGraph |
PgxGraph.simplify()
Blocking version of
simplifyAsync(). |
PgxGraph |
PgxGraph.simplify(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.TrivialVertices trivialVertices,
PgxGraph.Mode mode,
java.lang.String newGraphName)
|
PgxGraph |
PgxGraph.simplify(oracle.pgx.common.mutations.MutationStrategy mutationStrategy) |
PgxGraph |
PgxGraph.simplify(PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.TrivialVertices trivialVertices,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
simplifyAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String). |
PgxGraph |
PgxGraph.simplify(java.lang.String newGraphName)
Blocking version of
simplifyAsync(String). |
PgxGraph |
PgxGraph.sortByDegree()
Blocking version of
sortByDegreeAsync(). |
PgxGraph |
PgxGraph.sortByDegree(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
PgxGraph.SortOrder sortOrder,
PgxGraph.Degree degree,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
sortByDegreeAsync(Collection, Collection, SortOrder, Degree, Mode, String). |
PgxGraph |
PgxGraph.sortByDegree(PgxGraph.SortOrder sortOrder,
PgxGraph.Degree degree,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
sortByDegreeAsync(SortOrder, Degree, Mode, String). |
PgxGraph |
PgxGraph.sortByDegree(java.lang.String newGraphName)
Blocking version of
sortByDegreeAsync(String). |
PgxGraph |
PgxGraph.sparsify(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
double e,
java.lang.String newGraphName)
Blocking version of
sparsifyAsync(Collection, Collection, double, String). |
PgxGraph |
PgxGraph.sparsify(double e)
Blocking version of
sparsifyAsync(double). |
PgxGraph |
PgxGraph.sparsify(double e,
java.lang.String newGraphName)
Blocking version of
sparsifyAsync(double, String). |
default PgxGraph |
Synchronizer.sync()
Synchronize changes from the external data source.
|
PgxGraph |
PgxGraph.transpose()
Blocking version of
transposeAsync() |
PgxGraph |
PgxGraph.transpose(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
transposeAsync(Collection, Collection, Map, Mode, String) |
PgxGraph |
PgxGraph.transpose(PgxGraph.Mode mode)
Blocking version of
transposeAsync(Mode) |
PgxGraph |
PgxGraph.transpose(PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
transposeAsync(Mode, String) |
PgxGraph |
PgxGraph.transpose(java.lang.String newGraphName)
Blocking version of
transposeAsync(String) |
PgxGraph |
PgxGraph.undirect()
Blocking version of
undirectAsync(). |
PgxGraph |
PgxGraph.undirect(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.TrivialVertices trivialVertices,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String). |
PgxGraph |
PgxGraph.undirect(oracle.pgx.common.mutations.MutationStrategy mutationStrategy)
Blocking version of
undirectAsync(MutationStrategy) |
PgxGraph |
PgxGraph.undirect(PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Blocking version of
undirectAsync(MultiEdges, SelfEdges, Mode, String). |
PgxGraph |
PgxGraph.undirect(java.lang.String newGraphName)
Blocking version of
undirectAsync(String). |
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<PgxGraph> |
GraphBuilderImpl.buildAsync() |
PgxFuture<PgxGraph> |
GraphBuilder.buildAsync()
Shortcut for
GraphBuilder.buildAsync(String) without a name |
PgxFuture<PgxGraph> |
GraphBuilderImpl.buildAsync(java.lang.String newGraphName) |
PgxFuture<PgxGraph> |
GraphBuilder.buildAsync(java.lang.String newGraphName)
Builds a new graph out of the changes in this graph builder
|
PgxFuture<PgxGraph> |
GraphChangeSet.buildNewSnapshotAsync()
Builds a new snapshot of the graph out of
this GraphChangeSet: the resulting PgxGraph is a
new snapshot of the PgxGraph object this was created from. |
PgxFuture<PgxGraph> |
GraphChangeSetImpl.buildNewSnapshotAsync() |
PgxFuture<PgxGraph> |
PgxGraph.cloneAndExecutePgqlAsync(java.lang.String pgqlString)
|
PgxFuture<PgxGraph> |
PgxGraph.cloneAndExecutePgqlAsync(java.lang.String pgqlString,
java.lang.String newGraphName)
(BETA) Convenience method for executing
cloneAsync(String) on a graph and
executePgqlAsync(String) on its result |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync()
|
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
java.lang.String newGraphName)
Creates a deep copy of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(java.lang.String newGraphName)
Convenience method of
cloneAsync(Collection, Collection, String)Passing Collection(vertexProperties) as VertexProperty.ALL
Collection(edgeProperties) as EdgeProperty.ALL
|
PgxFuture<PgxGraph> |
PgxSession.createGraphFromFramesAsync(java.lang.String graphName,
oracle.pgx.api.beta.frames.PgxFrame vertexFrame,
oracle.pgx.api.beta.frames.PgxFrame edgeFrame)
Creates an homogeneous graph from the specified frames that represent the vertices and edges of the graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
GraphFilter graphFilter,
java.lang.String newGraphName)
Create a subgraph of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(GraphFilter graphFilter)
Create a subgraph of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(GraphFilter graphFilter,
java.lang.String newGraphName)
Create a subgraph of this graph.
|
PgxFuture<PgxGraph> |
PgxSession.getGraphAsync(Namespace namespace,
java.lang.String name)
References a graph with name
name within the given namespace:
- if namespace is Namespace.PRIVATE, than the search occurs on already referenced snapshots of the
graph with name name and the most recent snapshot is returned
- if namespace is Namespace.PUBLIC, then the search occurs on published graphs and the most recent
snapshot of the published graph with name name is returned
- if namespace is null, then the PRIVATE namespace is searched first and, if no snapshot is found,
the PUBLIC namespace is then searched, according to the shadowing rules
Multiple calls of this method with the same parameters will return different PgxGraph objects referencing
the same graph, with the server keeping track of how many references a session has to each graph. |
PgxFuture<PgxGraph> |
PgxSession.getGraphAsync(java.lang.String name)
References a graph with name
name loaded inside PGX. |
java.util.Map<java.lang.String,PgxGraph> |
PgxSession.getGraphs()
Deprecated.
|
PgxFuture<java.util.Map<java.lang.String,PgxGraph>> |
PgxSession.getGraphsAsync()
Deprecated.
since 19.4.0; use
PgxSession.getGraphsAsync(Namespace) instead |
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config,
GraphMetaData metaData)
Reads a graph and its properties of a specific version (metaData) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config,
GraphMetaData metaData,
java.lang.String newGraphName)
Reads a graph and its properties of a specific version (metaData) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config,
long creationTimestamp)
Reads a graph and its properties of a specific version (creationTimestamp) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config,
long creationTimestamp,
java.lang.String newGraphName)
Reads a graph and its properties of a specific version (creationTimestamp) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path)
Loads the graph contained in the file at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path,
Format format)
Loads the graph contained in the file at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path,
Format format,
java.lang.String newGraphName)
Loads the graph contained in the files at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path,
java.lang.String newGraphName)
Loads the graph contained in the file at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths,
Format format)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths,
Format format,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
boolean updateIfNotFresh)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
boolean updateIfNotFresh,
java.lang.String newGraphName)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
long maxAge,
java.util.concurrent.TimeUnit maxAgeTimeUnit)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
long maxAge,
java.util.concurrent.TimeUnit maxAgeTimeUnit,
boolean blockIfFull,
java.lang.String newGraphName)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
java.lang.String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(java.lang.String path)
Reads a graph and its properties, specified by a path to a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(java.lang.String path,
java.lang.String newGraphName)
Reads a graph and its properties, specified by a path to a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync()
Convenience method around
simplifyAsync(String) passing null as getId() |
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.TrivialVertices trivialVertices,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Create a simplified version of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(oracle.pgx.common.mutations.MutationStrategy mutationStrategy) |
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.TrivialVertices trivialVertices,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Convenience method for
simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String)Passing Collection(vertexProperties) as VertexProperty.ALL
Collection(edgeProperties) as EdgeProperty.ALL
Create a simplified version of a graph. |
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(java.lang.String newGraphName)
Convenience method for
simplifyAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String)Passing StrategyType as StrategyType.REMOVE_MULTI_EDGES
SelfEdges as SelfEdges.REMOVE_SELF_EDGES
Trivial Vertices as TrivialVertices.REMOVE_TRIVIAL_VERTICES
Mode as Mode.CREATE_COPY
Create a simplified version of a graph. |
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync()
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
PgxGraph.SortOrder sortOrder,
PgxGraph.Degree degree,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(PgxGraph.SortOrder sortOrder,
PgxGraph.Degree degree,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
double e,
java.lang.String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
|
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(double e)
Sparsifies the given graph and returns a new graph with less edges.
Convenience method around |
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(double e,
java.lang.String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
Convenience method around |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync()
Convenience method around
transposeAsync(String) passing null as getId() |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Creates a transpose of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(PgxGraph.Mode mode)
Convenience method around
transposeAsync(Mode, String) passing null as getId() |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(PgxGraph.Mode mode,
java.lang.String newGraphName)
Convenience method around
transposeAsync(Collection, Collection, Map, Mode, String)
Passing
Collection(vertexProps) as |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(java.lang.String newGraphName)
|
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync()
Convenience method around
undirectAsync(String) passing null as getId() |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Convenience method to create for
undirectAsync(MutationStrategy). |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(oracle.pgx.common.mutations.MutationStrategy mutationStrategy)
Create an undirected version of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(PgxGraph.MultiEdges multiEdges,
PgxGraph.SelfEdges selfEdges,
PgxGraph.Mode mode,
java.lang.String newGraphName)
Convenience method for
undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String)
Passing Collection(vertexProps) as |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(java.lang.String newGraphName)
Convenience method around
undirectAsync(MultiEdges, SelfEdges, Mode, String)
Passing
StrategyType as |
| Modifier and Type | Method and Description |
|---|---|
<V> EdgeProperty<java.lang.Double> |
Analyst.adamicAdarCounting(PgxGraph graph)
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
<V> EdgeProperty<java.lang.Double> |
Analyst.adamicAdarCounting(PgxGraph graph,
EdgeProperty<java.lang.Double> aa)
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph)
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> aa)
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.allReachableVerticesEdges(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.allReachableVerticesEdgesFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph,
int k)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentrality(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph,
PgxVertex<ID>... seeds)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
PgxVertex<ID>... seeds)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Boolean> |
Analyst.bipartiteCheck(PgxGraph graph,
VertexProperty<ID,java.lang.Boolean> isLeft)
Bipartite check verifies whether are graph is a bipartite graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>> |
Analyst.bipartiteCheckAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Boolean> isLeft)
Bipartite check verifies whether are graph is a bipartite graph.
|
<ID> VertexSet<ID> |
Analyst.center(PgxGraph graph)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexSet<ID> |
Analyst.center(PgxGraph graph,
VertexSet<ID> center)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph,
VertexSet<ID> center)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph,
EdgeProperty<java.lang.Double> cost)
Closenness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityDoubleLength(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc)
Closenness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost)
Closenness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc)
Closenness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph)
Closenness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.closenessCentralityUnitLength(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc)
Closenness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph)
Closenness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc)
Closenness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph,
int maxIterations)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesConductanceMinimization(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
int max)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight)
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter)
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter,
VertexProperty<ID,java.lang.Long> module)
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesInfomap(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter,
VertexProperty<ID,java.lang.Long> module)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module)
Infomap can find high quality communities in a graph.
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph)
Label propagation can find communities in a graph relatively fast
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph,
int maxIterations)
Label propagation can find communities in a graph relatively fast
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Label propagation can find communities in a graph relatively fast
|
<ID> Partition<ID> |
Analyst.communitiesLabelPropagation(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
int maxIterations)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Label propagation can find communities in a graph relatively fast
|
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>> |
Analyst.computeHighDegreeVertices(PgxGraph graph,
int k)
Computes the k vertices with the highest degrees in the graph.
|
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>> |
Analyst.computeHighDegreeVertices(PgxGraph graph,
int k,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices)
Computes the k vertices with the highest degrees in the graph.
|
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>> |
Analyst.computeHighDegreeVerticesAsync(PgxGraph graph,
int k)
Computes the k vertices with the highest degrees in the graph.
|
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>> |
Analyst.computeHighDegreeVerticesAsync(PgxGraph graph,
int k,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices)
Computes the k vertices with the highest degrees in the graph.
|
<ID> Scalar<java.lang.Double> |
Analyst.conductance(PgxGraph graph,
Partition<ID> partition,
long partitionIndex)
Conductance assesses the quality of a partition in a graph
|
<ID> Scalar<java.lang.Double> |
Analyst.conductance(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance)
Conductance assesses the quality of a partition in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex)
Conductance assesses the quality of a partition in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance)
Conductance assesses the quality of a partition in a graph
|
long |
Analyst.countTriangles(PgxGraph graph,
boolean sortVerticesByDegree)
triangle counting gives an overview of the amount of connections between vertices in neighborhoods
|
PgxFuture<java.lang.Long> |
Analyst.countTrianglesAsync(PgxGraph graph,
boolean sortVerticesByDegree)
triangle counting gives an overview of the amount of connections between vertices in neighborhoods
|
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>> |
Analyst.createDistanceIndex(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices)
Computes an index with distances to each high-degree vertex.
|
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>> |
Analyst.createDistanceIndex(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes an index with distances to each high-degree vertex.
|
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>> |
Analyst.createDistanceIndexAsync(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices)
Computes an index with distances to each high-degree vertex.
|
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>> |
Analyst.createDistanceIndexAsync(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes an index with distances to each high-degree vertex.
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph)
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.degreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc)
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph)
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc)
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph)
Diameter/radius gives an overview of the distances in a graph
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.diameter(PgxGraph graph,
Scalar<java.lang.Integer> diameter,
VertexProperty<ID,java.lang.Integer> eccentricity)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph,
Scalar<java.lang.Integer> diameter,
VertexProperty<ID,java.lang.Integer> eccentricity)
Diameter/radius gives an overview of the distances in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge,
VertexProperty<ID,java.lang.Double> ec)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.eigenvectorCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge,
VertexProperty<ID,java.lang.Double> ec)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence> |
Analyst.enumerateSimplePaths(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
VertexSet verticesOnPath,
EdgeSet edgesOnPath,
PgxMap<PgxVertex<ID>,java.lang.Integer> dist)
Enumerate all simple paths between the source and destination vertex
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>> |
Analyst.enumerateSimplePathsAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
VertexSet verticesOnPath,
EdgeSet edgesOnPath,
PgxMap<PgxVertex<ID>,java.lang.Integer> dist)
Enumerate all simple paths between the source and destination vertex
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
ID rootId,
EdgeProperty<java.lang.Double> capacity)
Convenience wrapper around
Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID instead of a
PgxVertex. |
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
ID rootId,
EdgeProperty<java.lang.Double> capacity,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty, VertexProperty,
VertexProperty, VertexProperty) taking a vertex ID instead of a
PgxVertex. |
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity)
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<ID> AllPaths<ID> |
Analyst.fattestPath(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity)
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph,
PgxVertex<ID> root,
EdgeProperty<java.lang.Double> capacity,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
int maxDepth)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Convenience wrapper around
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, boolean) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, boolean, int) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, boolean, int, VertexProperty, VertexProperty) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty, VertexProperty) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredBfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfs(PgxGraph, PgxVertex, VertexFilter, int) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, int) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, int,
VertexProperty, VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty,
VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, int) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
int maxDepth)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, int, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, boolean, VertexProperty,
VertexProperty)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
ID root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Convenience wrapper around
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int)
taking a vertex ID instead of PgxVertex. |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, boolean) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, boolean, int) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, boolean, int, VertexProperty, VertexProperty) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty, VertexProperty) instead |
<ID> Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>> |
Analyst.filteredDfs(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfs(PgxGraph, PgxVertex, VertexFilter, VertexFilter, int) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex,VertexFilter, boolean) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, int) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty, VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty, VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, int) instead |
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph)
Find cycle looks for any loop in the graph.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph,
PgxVertex<ID> src)
Find cycle looks for any loop in the graph.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq)
Find cycle looks for any loop in the graph.
|
<ID> PgxPath<ID> |
Analyst.findCycle(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
PgxVertex<ID> src)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq)
Find cycle looks for any loop in the graph.
|
java.util.Deque<GraphMetaData> |
PgxSession.getAvailableSnapshots(PgxGraph snapshot)
Blocking version of
PgxSession.getAvailableSnapshotsAsync(PgxGraph). |
PgxFuture<java.util.Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(PgxGraph graph)
Gets a list of the
GraphMetaData information of available in-memory snapshots of graph. |
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph,
int max)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>> |
Analyst.hits(PgxGraph graph,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
int max)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
int max,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> auth,
VertexProperty<ID,java.lang.Double> hubs)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph)
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.inDegreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc)
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph)
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc)
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.inDegreeDistribution(PgxGraph graph)
In-degree distribution gives information about the incoming flows in a graph
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.inDegreeDistribution(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution)
In-degree distribution gives information about the incoming flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph)
In-degree distribution gives information about the incoming flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution)
In-degree distribution gives information about the incoming flows in a graph
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph,
int minCore,
int maxCore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph,
int minCore,
int maxCore,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>> |
Analyst.kcore(PgxGraph graph,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
int minCore,
int maxCore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
int minCore,
int maxCore,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
Scalar<java.lang.Long> maxKCore,
VertexProperty<ID,java.lang.Long> kcore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter)
Computes the k-hop limited shortest path between two vertices.
|
<ID> Pair<VertexSequence<ID>,EdgeSequence> |
Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph)
LCC gives information about potential clustering options in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.localClusteringCoefficient(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc)
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph)
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc)
LCC gives information about potential clustering options in a graph
|
<ID> VertexProperty<ID,java.lang.Long> |
Analyst.louvain(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
Louvain can detect communities in a large graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Long> |
Analyst.louvain(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter)
Louvain can detect communities in a large graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Long> |
Analyst.louvain(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter,
int nbrPass,
double tol,
VertexProperty<ID,java.lang.Long> community)
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter)
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter,
int nbrPass,
double tol,
VertexProperty<ID,java.lang.Long> community)
Louvain can detect communities in a large graph relatively fast.
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph)
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.outDegreeCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc)
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph)
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph,
java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> dc)
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.outDegreeDistribution(PgxGraph graph)
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxMap<java.lang.Integer,java.lang.Long> |
Analyst.outDegreeDistribution(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution)
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph)
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution)
Out-degree distribution gives information about the outgoing flows in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
boolean norm)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerank(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph)
Faster, but less accurate than pagerank.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph,
double e,
double d,
int max)
Faster, but less accurate than pagerank.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Faster, but less accurate than pagerank.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.pagerankApproximate(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
boolean norm)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> |
Analyst.partitionConductance(PgxGraph graph,
Partition<ID> partition)
Partition conductance assesses the quality of many partitions in a graph
|
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>> |
Analyst.partitionConductance(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> avgConductance,
Scalar<java.lang.Double> minConductance)
Partition conductance assesses the quality of many partitions in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition)
Partition conductance assesses the quality of many partitions in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> avgConductance,
Scalar<java.lang.Double> minConductance)
Partition conductance assesses the quality of many partitions in a graph
|
<ID> Scalar<java.lang.Double> |
Analyst.partitionModularity(PgxGraph graph,
Partition<ID> partition)
Modularity summarizes information about the quality of components in a graph
|
<ID> Scalar<java.lang.Double> |
Analyst.partitionModularity(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity)
Modularity summarizes information about the quality of components in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition)
Modularity summarizes information about the quality of components in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity)
Modularity summarizes information about the quality of components in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
java.lang.String modularityName) |
<ID> VertexSet<ID> |
Analyst.periphery(PgxGraph graph)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexSet<ID> |
Analyst.periphery(PgxGraph graph,
VertexSet<ID> periphery)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph,
VertexSet<ID> periphery)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max)
Convenience wrapper around
Analyst.personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,)
taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm)
Convenience wrapper around
Analyst.personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
boolean) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean,
VertexProperty taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
VertexProperty taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Convenience wrapper around
Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
boolean, EdgeProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, boolean, EdgeProperty,
VertexProperty taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
EdgeProperty<java.lang.Double> weight)
Convenience wrapper around
Analyst.personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int,
EdgeProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
ID vertexId,
java.math.BigDecimal e,
java.math.BigDecimal d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Convenience wrapper around
#personalizedWeightedPagerank(PgxGraph, PgxVertex, BigDecimal, BigDecimal, int, EdgeProperty,
VertexProperty taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank for a set of vertices and weighted edges.
|
EdgeProperty<java.lang.Boolean> |
Analyst.prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
prim reveals tree structures with shortest paths in a graph
|
EdgeProperty<java.lang.Boolean> |
Analyst.prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst)
prim reveals tree structures with shortest paths in a graph
|
EdgeProperty<java.lang.Boolean> |
Analyst.prim(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
java.lang.String mstName)
Convenience wrapper around
Analyst.prim(PgxGraph, EdgeProperty, String) |
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
prim reveals tree structures with shortest paths in a graph
|
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst)
prim reveals tree structures with shortest paths in a graph
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph)
Diameter/radius gives an overview of the distances in a graph
|
<ID> Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>> |
Analyst.radius(PgxGraph graph,
Scalar<java.lang.Integer> radius,
VertexProperty<ID,java.lang.Integer> eccentricity)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph,
Scalar<java.lang.Integer> radius,
VertexProperty<ID,java.lang.Integer> eccentricity)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer> |
Analyst.randomWalkWithRestart(PgxGraph graph,
ID source,
int length,
java.math.BigDecimal resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount)
Convenience wrapper around
Analyst.randomWalkWithRestart(PgxGraph, PgxVertex, int, double,
PgxMap) taking a vertex ID instead of a PgxVertex. |
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer> |
Analyst.randomWalkWithRestart(PgxGraph graph,
PgxVertex<ID> source,
int length,
double resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount)
random walk with restart does the what its name says, it can find approximate stationary distributions
|
<ID> PgxFuture<PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.randomWalkWithRestartAsync(PgxGraph graph,
PgxVertex<ID> source,
int length,
double resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount)
random walk with restart does the what its name says, it can find approximate stationary distributions
|
<ID> java.lang.Integer |
Analyst.reachability(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection)
Reachability is a fast way to check if two vertices are reachable from each other.
|
<ID> PgxFuture<java.lang.Integer> |
Analyst.reachabilityAsync(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection)
Reachability is a fast way to check if two vertices are reachable from each other.
|
<ID> Partition<ID> |
Analyst.sccKosaraju(PgxGraph graph)
Kosaraju finds strongly connected components in a graph
|
<ID> Partition<ID> |
Analyst.sccKosaraju(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Kosaraju finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph)
Kosaraju finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Kosaraju finds strongly connected components in a graph
|
<ID> Partition<ID> |
Analyst.sccTarjan(PgxGraph graph)
Tarjan finds strongly connected components in a graph
|
<ID> Partition<ID> |
Analyst.sccTarjan(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Tarjan finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph)
Tarjan finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution)
Tarjan finds strongly connected components in a graph
|
Synchronizer.Builder<T> |
Synchronizer.Builder.setGraph(PgxGraph graph)
Sets the target graph to synchronize.
|
void |
PgxSession.setSnapshot(PgxGraph graph,
GraphMetaData metaData)
Blocking version of
PgxSession.setSnapshotAsync(PgxGraph, GraphMetaData). |
void |
PgxSession.setSnapshot(PgxGraph graph,
GraphMetaData metaData,
boolean forceDeleteProperties)
Blocking version of
PgxSession.setSnapshotAsync(PgxGraph, GraphMetaData, boolean). |
void |
PgxSession.setSnapshot(PgxGraph graph,
long creationTimestamp)
Blocking version of
PgxSession.setSnapshotAsync(PgxGraph, long). |
void |
PgxSession.setSnapshot(PgxGraph graph,
long creationTimestamp,
boolean forceDeleteProperties)
Blocking version of
PgxSession.setSnapshotAsync(PgxGraph, long, boolean). |
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph,
GraphMetaData metaData)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph,
GraphMetaData metaData,
boolean forceDeleteTransientProperties)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph,
long creationTimestamp)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph,
long creationTimestamp,
boolean forceDeleteTransientProperties)
Sets a graph to a specific snapshot.
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty) taking a vertex ID
instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty, VertexProperty,
VertexProperty, VertexProperty) taking a vertex ID
instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost)
Bellman-ford finds multiple shortest paths at the same time
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFord(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost)
Bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Bellman-ford finds multiple shortest paths at the same time
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty) taking a
vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph,
ID srcId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty,
VertexProperty, VertexProperty, VertexProperty) taking a
vertex ID instead of PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost)
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> AllPaths<ID> |
Analyst.shortestPathBellmanFordReverse(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost)
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking
vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty) taking
vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost)
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost)
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost)
Convenience wrapper around
Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost)
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxPath<ID> |
Analyst.shortestPathDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost)
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
java.lang.String parentName,
java.lang.String parentEdgeName) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs
instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter) taking vertex IDs
instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstra(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
ID srcId,
ID dstId,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)
taking vertex IDs instead of PgxVertex. |
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxPath<ID> |
Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
java.lang.String parentName,
java.lang.String parentEdgeName) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
ID srcId)
Convenience wrapper around
Analyst.shortestPathHopDist(PgxGraph, PgxVertex) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
ID srcId,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDist(PgxGraph, PgxVertex, VertexProperty, VertexProperty,
VertexProperty) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src)
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDist(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src)
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
ID srcId)
Convenience wrapper around
Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
ID srcId,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Convenience wrapper around
Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex, VertexProperty, VertexProperty,
VertexProperty) taking a vertex ID instead of
PgxVertex. |
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
PgxVertex<ID> src)
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<ID> AllPaths<ID> |
Analyst.shortestPathHopDistReverse(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph,
PgxVertex<ID> src)
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexProperty<ID,java.lang.Double> distance,
VertexProperty<ID,PgxVertex<ID>> parent,
VertexProperty<ID,PgxEdge> parentEdge)
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSchedule(PgxGraph graph,
VertexSet<ID> source)
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSchedule(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source)
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched)
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSort(PgxGraph graph)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> VertexProperty<ID,java.lang.Integer> |
Analyst.topologicalSort(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalSortAsync(PgxGraph graph)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalSortAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph)
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.vertexBetweennessCentrality(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc)
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph)
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc)
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> Partition<ID> |
Analyst.wcc(PgxGraph graph)
Identifying weakly connected components can be useful for clustering graph data
|
<ID> Partition<ID> |
Analyst.wcc(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Identifying weakly connected components can be useful for clustering graph data
|
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph)
Identifying weakly connected components can be useful for clustering graph data
|
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph,
java.lang.String partitonDistributionName) |
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Identifying weakly connected components can be useful for clustering graph data
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.weightedPagerank(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK)
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int) taking a vertex ID instead of a
PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust)
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int, int) taking a vertex ID instead of a
PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust,
int maxIter,
java.math.BigDecimal tol,
java.math.BigDecimal dampingFactor,
int salsaMaxIter,
java.math.BigDecimal salsaTol)
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal)
taking a vertex ID instead of a PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
ID vertexId,
int topK,
int sizeCircleOfTrust,
int maxIter,
java.math.BigDecimal tol,
java.math.BigDecimal dampingFactor,
int salsaMaxIter,
java.math.BigDecimal salsaTol,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, BigDecimal, BigDecimal, int, BigDecimal, VertexSequence,
VertexSequence)
taking a vertex ID instead of a PgxVertex. |
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>> |
Analyst.whomToFollow(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
int maxIter,
double tol,
double dampingFactor,
int salsaMaxIter,
double salsaTol,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
static <V> V |
Property.wrap(V value,
PropertyType type,
PgxGraph graph) |
| Constructor and Description |
|---|
ComponentCollection(PgxGraph graph,
oracle.pgx.common.PgxId collectionNamespace,
long id) |
EdgeLabel(PgxGraph graph,
oracle.pgx.api.internal.Property pr) |
PartitionizingStrategyBuilder(PgxGraph graph)
Constructs an empty builder that will set up a default strategy
|
VertexLabels(PgxGraph graph,
oracle.pgx.api.internal.Property pr) |
| Modifier and Type | Method and Description |
|---|---|
default PgxGraph |
GraphAlterationBuilder.build()
Create a new graph that is the result of the alteration of the current graph.
|
default PgxGraph |
GraphAlterationBuilder.build(java.lang.String newGraphName)
Create a new graph that is the result of the alteration of the current graph.
|
default PgxGraph |
GraphAlterationBuilder.buildNewSnapshot()
Create a new snapshot for the current graph that is the result of the alteration of the current snapshot.
|
| Modifier and Type | Method and Description |
|---|---|
default PgxFuture<PgxGraph> |
GraphAlterationBuilder.buildAsync()
Create a new graph that is the result of the alteration of the current graph.
|
PgxFuture<PgxGraph> |
GraphAlterationBuilder.buildAsync(java.lang.String newGraphName)
Create a new graph that is the result of the alteration of the current graph.
|
PgxFuture<PgxGraph> |
GraphAlterationBuilder.buildNewSnapshotAsync()
Create a new snapshot for the current graph that is the result of the alteration of the current snapshot.
|
Copyright © 2015 - 2020 Oracle and/or its affiliates. All Rights Reserved.