| Package | Description |
|---|---|
| oracle.pgx.api |
This package contains the main Java APIs.
|
| Modifier and Type | Method and Description |
|---|---|
<E> EdgeProperty<PgxVect<E>> |
PgxGraph.combineEdgePropertiesIntoVectorProperty(java.util.List<EdgeProperty<E>> edgePropertyList)
Blocking version of
PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List)
Calls PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List) and waits for the returned
PgxFuture to complete. |
<E> EdgeProperty<PgxVect<E>> |
PgxGraph.combineEdgePropertiesIntoVectorProperty(java.util.List<EdgeProperty<E>> edgePropertyList,
java.lang.String name)
Blocking version of
PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List, String)
Calls PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(List, String) and waits for the returned
PgxFuture to complete. |
<E> PgxFuture<EdgeProperty<PgxVect<E>>> |
PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(java.util.List<EdgeProperty<E>> edgePropertyList)
Takes a list of scalar edge properties of same type and creates a new edge vector property by combining them.
|
<E> PgxFuture<EdgeProperty<PgxVect<E>>> |
PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(java.util.List<EdgeProperty<E>> edgePropertyList,
java.lang.String name)
Takes a list of scalar edge properties of same type and creates a new edge vector property by combining them.
|
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Blocking version of
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List)
Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List) and waits for the returned
PgxFuture to complete. |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.combineVertexPropertiesIntoVectorProperty(java.util.List<VertexProperty<ID,V>> vertexPropertyList,
java.lang.String name)
Blocking version of
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String)
Calls PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(List, String) and waits for the returned
PgxFuture to complete. |
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList,
java.lang.String name)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<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.
|
<V> EdgeProperty<PgxVect<V>> |
PgxGraph.createEdgeVectorProperty(PropertyType type,
int dimension)
Blocking version of
PgxGraph.createEdgeVectorPropertyAsync(PropertyType, int). |
<V> EdgeProperty<PgxVect<V>> |
PgxGraph.createEdgeVectorProperty(PropertyType type,
int dimension,
java.lang.String name)
Blocking version of
PgxGraph.createEdgeVectorPropertyAsync(PropertyType, int, String). |
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.createEdgeVectorPropertyAsync(PropertyType type,
int dimension)
Creates a session-bound edge vector property
|
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.createEdgeVectorPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Creates a session-bound edge vector property
|
<T> Scalar<PgxVect<T>> |
PgxGraph.createVectorScalar(PropertyType type,
int dimension)
Blocking version of
PgxGraph.createVectorScalarAsync(PropertyType, int). |
<T> Scalar<PgxVect<T>> |
PgxGraph.createVectorScalar(PropertyType type,
int dimension,
java.lang.String newScalarName)
Blocking version of
PgxGraph.createVectorScalarAsync(PropertyType, int, String). |
<T> PgxFuture<Scalar<PgxVect<T>>> |
PgxGraph.createVectorScalarAsync(PropertyType type,
int dimension)
Create a session-bound vector scalar.
|
<T> PgxFuture<Scalar<PgxVect<T>>> |
PgxGraph.createVectorScalarAsync(PropertyType type,
int dimension,
java.lang.String newScalarName)
Create a session-bound vector scalar.
|
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.createVertexVectorProperty(PropertyType type,
int dimension)
Blocking version of
PgxGraph.createVertexVectorPropertyAsync(PropertyType, int). |
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.createVertexVectorProperty(PropertyType type,
int dimension,
java.lang.String name)
Blocking version of
PgxGraph.createVertexVectorPropertyAsync(PropertyType, int, String). |
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.createVertexVectorPropertyAsync(PropertyType type,
int dimension)
Creates a session-bound vertex vector property
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.createVertexVectorPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Creates a session-bound vertex vector property
|
VertexProperty<ID,PgxVect<java.lang.Double>> |
MatrixFactorizationModel.getFeatures()
Gets the features of this model.
|
<V> EdgeProperty<PgxVect<V>> |
PgxGraph.getOrCreateEdgeVectorProperty(PropertyType type,
int dimension,
java.lang.String name)
Blocking version of
PgxGraph.getOrCreateEdgeVectorPropertyAsync(PropertyType, int, String). |
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.getOrCreateEdgeVectorPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Gets or creates an edge vector property
|
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.getOrCreateEdgeVertexPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Gets or creates an edge vector property
|
<ID,V> VertexProperty<ID,PgxVect<V>> |
PgxGraph.getOrCreateVertexVectorProperty(PropertyType type,
int dimension,
java.lang.String name)
Blocking version of
PgxGraph.getOrCreateVertexVectorPropertyAsync(PropertyType, int, String). |
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.getOrCreateVertexVectorPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Gets or creates a vertex vector property
|
| Modifier and Type | Method and Description |
|---|---|
int |
PgxVect.compareTo(PgxVect<E> other) |
| Modifier and Type | Method and Description |
|---|---|
<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,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes an index with distances to each high-degree vertex.
|
<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> MatrixFactorizationModel<ID> |
Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> features)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> MatrixFactorizationModel<ID> |
Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,PgxVect<java.lang.Double>> features)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> features)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,PgxVect<java.lang.Double>> features)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.matrixFactorizationRecommendations(BipartiteGraph graph,
ID user,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> feature,
VertexProperty<ID,java.lang.Double> estimatedRating)
Convenience wrapper around
Analyst.matrixFactorizationRecommendations(BipartiteGraph, PgxVertex, int,
VertexProperty, VertexProperty) taking a vertex ID instead of a PgxVertex. |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.matrixFactorizationRecommendations(BipartiteGraph graph,
PgxVertex<ID> user,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> feature,
VertexProperty<ID,java.lang.Double> estimatedRating)
Estimate rating can be used as a prediction algorithm for bipartite graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.matrixFactorizationRecommendationsAsync(BipartiteGraph graph,
PgxVertex<ID> user,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> feature,
VertexProperty<ID,java.lang.Double> estimatedRating)
Estimate rating can be used as a prediction algorithm for bipartite graphs
|
Copyright © 2015 - 2020 Oracle and/or its affiliates. All Rights Reserved.