Package | Description |
---|---|
oracle.pgx.api |
This package contains the main Java APIs.
|
Modifier and Type | Method and Description |
---|---|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph)
Computes the center of the (undirected) graph.
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center) |
<E> PgxFuture<VertexSet<E>> |
PgxGraph.createVertexSetAsync()
Creates a new vertex set.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.createVertexSetAsync(java.lang.String name)
Creates a new vertex set.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.getVerticesAsync()
Creates a new vertex set containing all vertices.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.getVerticesAsync(VertexFilter filter)
Creates a new vertex set containing vertices according to the given filter expression.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.getVerticesAsync(VertexFilter filter, java.lang.String name)
Creates a new vertex set containing vertices according to the given filter expression.
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph)
Computes the periphery of the (undirected) graph.
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery) |
Modifier and Type | Method and Description |
---|---|
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName)
|
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName)
|
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet)
Blocking version of
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet) . |
BipartiteGraph |
PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet, java.lang.String newGraphName)
Blocking version of
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet, String) . |
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, java.lang.String newGraphName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
<ID> VertexSet<ID> |
Analyst.center(PgxGraph graph, VertexSet<ID> center)
Blocking version of
Analyst.centerAsync(PgxGraph, VertexSet) . |
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center) |
<ID> VertexSet<ID> |
Analyst.periphery(PgxGraph graph, VertexSet<ID> periphery)
Blocking version of
Analyst.peripheryAsync(PgxGraph, VertexSet) . |
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery) |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, boolean) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, boolean, VertexProperty<ID, Double>) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
Blocking version of
Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean) . |
<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)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, VertexProperty<ID, Double>) . |
<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)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int, VertexProperty<ID, Double>) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedPagerankAsync(PgxGraph, VertexSet, VertexProperty<ID, Double>) . |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<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 (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<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 (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank)
Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices)
Blocking version of
Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff)
Blocking version of
Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double, VertexProperty<ID, Double>) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
Blocking version of
#personalizedSalsaAsync(BipartiteGraph, VertexSet, VertexProperty<ID, Double>) . |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank)
Personalized SALSA computes recommendations ith respect to a given set of vertices.
|
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
|
<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)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, boolean, EdgeProperty,VertexProperty<ID, Double>) . |
<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)
|
<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)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, boolean, EdgeProperty, VertexProperty<ID, Double>) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight)
|
<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)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, double, double, int, EdgeProperty, VertexProperty<ID, Double>) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
Blocking version of
Analyst.personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty) . |
<ID> VertexProperty<ID,java.lang.Double> |
Analyst.personalizedWeightedPagerank(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank)
Blocking version of
#personalizedWeightedPagerankAsync(PgxGraph, VertexSet, EdgeProperty,VertexProperty<ID, Double>) . |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<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 weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<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 weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<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 weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<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 weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<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 weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
<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 weighted pagerank computes the pagerank score with respect to a given vertex v or set of vertices from the graph and their corresponding weights.
|
Copyright © 2017 Oracle Corp. All Rights Reserved.