Package | Description |
---|---|
oracle.pgx.api |
This package contains the main Java APIs.
|
Modifier and Type | Method and Description |
---|---|
<E> VertexSet<E> |
PgxGraph.createVertexSet()
Blocking version of
PgxGraph.createVertexSetAsync() . |
<E> VertexSet<E> |
PgxGraph.createVertexSet(java.lang.String name)
Blocking version of
PgxGraph.createVertexSetAsync(String) . |
<E> VertexSet<E> |
PgxGraph.getVertices()
Blocking version of
PgxGraph.getVerticesAsync() . |
<E> VertexSet<E> |
PgxGraph.getVertices(VertexFilter filter)
Blocking version of
PgxGraph.getVerticesAsync(VertexFilter) . |
Modifier and Type | Method and Description |
---|---|
<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.
|
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.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName) |
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet)
Create a bipartite version of this graph.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, java.lang.String newGraphName)
Create a bipartite version of this graph.
|
<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, 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, 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, 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, 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.
|
Copyright © 2016 Oracle Corp. All Rights Reserved.