Uses of Class
oracle.pgx.api.PgxFuture

Packages that use PgxFuture

Package	Description
oracle.pgx.api	This package contains the main Java APIs.
oracle.pgx.api.admin	This package contains the administrative interfaces of PGX.

Uses of PgxFuture in oracle.pgx.api

Methods in oracle.pgx.api that return PgxFuture

Modifier and Type	Method and Description
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph) Computes 'Adamic-Adar measure' for each edge in the graph.
PgxFuture<EdgeProperty<java.lang.Double>>	Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa) Computes 'Adamic-Adar measure' for each edge in the graph.
PgxFuture<java.lang.Void>	PgxCollection.addAllAsync(java.util.Collection<E> source) Add vertices/edges to an existing vertex/edge collection
PgxFuture<java.lang.Void>	PgxCollection.addAllAsync(E[] elements) Add vertices/edges to an existing vertex/edge collection
PgxFuture<java.lang.Void>	ServerInstance.addPinnedGraphAsync(GraphConfig cfg) Add a pinned graph (will not be unloaded by engine) to be shared between sessions
static <T> PgxFuture<java.lang.Void>	PgxFuture.allOf(java.util.List<PgxFuture<T>> promises)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k) Approximate vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc) Approximate vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds) Approximate vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds) Approximate vertex betweenness centrality (without considering edge length).
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.
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<T>	PgxFuture.cancelOn(PgxFuture promise) If given promise completes exceptionally because it was canceled, cancel() gets called on this promise as well.
PgxFuture<java.lang.Void>	PgxCollection.clearAsync() Clear an existing vertex/edge collection
PgxFuture<PgxCollection<E,ID>>	PgxCollection.cloneAsync() Convenience method around PgxCollection.cloneAsync(String) passing name as null Clone an existing vertex/edge collection.
PgxFuture<EdgeProperty<V>>	EdgeProperty.cloneAsync() Create a copy of this property. Convenience method for EdgeProperty.cloneAsync(String) passing newPropertyName as null
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync() Create a copy of this property. Convenience method for VertexProperty.cloneAsync(String) passing newPropertyName as null
PgxFuture<PgxGraph>	PgxGraph.cloneAsync() Convenience method of PgxGraph.cloneAsync(String) Passing String(name) as null
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Creates a copy of this graph.
PgxFuture<PgxCollection<E,ID>>	PgxCollection.cloneAsync(java.lang.String newName) Clone an existing vertex/edge collection.
PgxFuture<EdgeProperty<V>>	EdgeProperty.cloneAsync(java.lang.String newPropertyName) Creates a copy of this property.
PgxFuture<VertexProperty<ID,V>>	VertexProperty.cloneAsync(java.lang.String newPropertyName) Creates a copy of this property.
PgxFuture<PgxGraph>	PgxGraph.cloneAsync(java.lang.String newGraphName) Convenience method of PgxGraph.cloneAsync(Collection, Collection, String) Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALL
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost) Compute closeness centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) Compute closeness centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph) Compute closeness centrality.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc) Compute closeness centrality.
<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> 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> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using greedy conductance minimization.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph) Detect communities using parallel label propagation.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration) Detect communities using parallel label propagation with the possibility to limit the number of iterations.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using parallel label propagation with the possibility to limit the number of iterations.
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) Detect communities using parallel label propagation with the possibility to limit the number of iterations.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramAsync(java.io.InputStream code) Deprecated.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramAsync(java.io.InputStream code, boolean overwrite) Deprecated.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramAsync(java.lang.String path) Deprecated.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramAsync(java.lang.String path, boolean overwrite) Deprecated.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramCodeAsync(java.lang.String code) Compiles a Green-Marl program for parallel execution with all optimizations enabled.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramCodeAsync(java.lang.String code, boolean overwrite) Compiles a Green-Marl program for parallel execution with all optimizations enabled.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.compileProgramCodeAsync(java.lang.String code, boolean overwrite, boolean parallel, java.util.List<oracle.pgx.api.GmCompilerOptimization> disabledOptimizations, boolean verbose) Compiles a Green-Marl program.
static <T> PgxFuture<T>	PgxFuture.completedFuture(T arg)
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex) Compute the conductance of a single vertex partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex, Scalar<java.lang.Double> conductance) Compute the conductance of a single vertex partition.
PgxFuture<java.lang.Boolean>	PgxMap.containsKeyAsync(K key) Checks if the map contains key.
PgxFuture<java.lang.Long>	Analyst.countTrianglesAsync(PgxGraph graph, boolean sortVerticesByDegree) Counts the number of 'triads' in the given undirected graph.
<ID> PgxFuture<AllPaths<ID>>	PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
<ID> PgxFuture<Partition<ID>>	PgxGraph.createComponentsAsync(VertexProperty<ID,java.lang.Long> components, long numComponents) Creates a Partition object holding a collection of vertex sets, each representing a component.
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.createEdgePropertyAsync(PropertyType type) Creates a session-bound edge property
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.createEdgePropertyAsync(PropertyType type, java.lang.String name) Creates a session-bound edge property
PgxFuture<EdgeSequence>	PgxGraph.createEdgeSequenceAsync() Creates a new edge sequence.
PgxFuture<EdgeSequence>	PgxGraph.createEdgeSequenceAsync(java.lang.String name) Creates a new edge sequence.
PgxFuture<EdgeSet>	PgxGraph.createEdgeSetAsync() Creates a new edge set.
PgxFuture<EdgeSet>	PgxGraph.createEdgeSetAsync(java.lang.String name) Creates a new edge set.
<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
<K,V> PgxFuture<PgxMap<K,V>>	PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType) Creates a session-bound map
<K,V> PgxFuture<PgxMap<K,V>>	PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType, java.lang.String mapName) Creates a session-bound map
<ID> PgxFuture<PgxPath<ID>>	PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) Creates a PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
<T> PgxFuture<Scalar<T>>	PgxGraph.createScalarAsync(PropertyType type) Creates a new Scalar.
<T> PgxFuture<Scalar<T>>	PgxGraph.createScalarAsync(PropertyType type, java.lang.String newScalarName) Create a session-bound scalar.
PgxFuture<PgxSession>	ServerInstance.createSessionAsync(java.lang.String source) Create a new session.
PgxFuture<PgxSession>	ServerInstance.createSessionAsync(java.lang.String source, java.lang.Long idleTimeout, java.lang.Long taskTimeout, java.util.concurrent.TimeUnit unit) Creates a new session.
<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> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type) Creates a session-bound vertex property
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.createVertexPropertyAsync(PropertyType type, java.lang.String name) Creates a session-bound vertex property
<E> PgxFuture<VertexSequence<E>>	PgxGraph.createVertexSequenceAsync() Creates a new vertex sequence.
<E> PgxFuture<VertexSequence<E>>	PgxGraph.createVertexSequenceAsync(java.lang.String name) Creates a new vertex sequence.
<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.
<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
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.degreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the sum of in- and out-degree.
<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) Compute vertex centrality based on the sum of in- and out-degree.
PgxFuture<java.lang.Void>	ServerInstance.demotePinnedGraphAsync(GraphConfig cfg) Demote pinned graph.
PgxFuture<GraphConfig>	PgxSession.describeGraphFileAsync(java.lang.String path) Describes the graph contained in the file at the given path.
PgxFuture<GraphConfig>	PgxSession.describeGraphFileAsync(java.lang.String path, Format format) Describes the graph contained in the file at the given path.
PgxFuture<java.lang.Void>	Destroyable.destroyAsync() Requests destruction of this object.
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.diameterAsync(PgxGraph graph) Computes the diameter of the (undirected) 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) Computes the diameter of the (undirected) graph.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph) Compute eigenvector centrality using power iteration (with L1 norm).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) Compute eigenvector centrality using power iteration (with L1 norm).
<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) Compute eigenvector centrality using power iteration (with L1 norm).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec) Compute eigenvector centrality using power iteration (with L1 norm).
PgxFuture<MapIterable<K,V>>	PgxMap.entriesAsync() Gets an entry set.
static <T> PgxFuture<T>	PgxFuture.exceptionallyCompletedFuture(java.lang.Throwable throwable)
<S> PgxFuture<java.util.List<EdgeProperty<S>>>	EdgeProperty.expandAsync() If this is a vector property, expands this property into a list of scalar properties of same type.
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>>	VertexProperty.expandAsync() If this is a vector property, expands this property into a list of scalar properties of same type.
<S> PgxFuture<java.util.List<EdgeProperty<S>>>	EdgeProperty.expandAsync(java.lang.String namePrefix) If this is a vector property, expands this property into a list of scalar properties of same type.
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>>	VertexProperty.expandAsync(java.lang.String namePrefix) If this is a vector property, expands this property into a list of scalar properties of same type.
<V extends java.lang.Comparable<V>> PgxFuture<java.lang.Void>	VertexSet.extractTopKFromMapAsync(PgxMap<PgxVertex<ID>,V> map, int k) Extracts the top k keys from the given map and puts them into this collection.
<ID> PgxFuture<AllPaths<ID>>	Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
<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 Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
PgxFuture<java.lang.Void>	Property.fillAsync(V value) Fill this property with a given value.
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.
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>>	Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator)
<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)
<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)
PgxFuture<V>	Scalar.getAsync()
PgxFuture<V>	Property.getAsync(ID id) Gets the property value.
PgxFuture<V>	Property.getAsync(K key) Gets the property value.
PgxFuture<V>	PgxMap.getAsync(K key) Gets the value of a key.
PgxFuture<java.util.Set<java.lang.String>>	PgxSession.getAvailableCompiledProgramIdsAsync() Gets the set of available compiled program IDs.
PgxFuture<java.util.Deque<GraphMetaData>>	PgxSession.getAvailableSnapshotsAsync(GraphConfig config) Gets a list of available in-memory snapshots of a graph described by a graph configuration.
PgxFuture<java.util.Deque<GraphMetaData>>	PgxSession.getAvailableSnapshotsAsync(PgxGraph snapshot) Gets a list of available in-memory snapshots of a given snapshot.
PgxFuture<EntryIterable<ID,K,V>>	Property.getBottomKValuesAsync(int k) Gets the bottom k vertex/edge value pairs according to their value.
PgxFuture<oracle.pgx.api.CompiledProgram>	PgxSession.getCompiledProgramAsync(java.lang.String id) Gets a compiled program by ID.
<ID> PgxFuture<PgxVertex<ID>>	PgxEdge.getDestinationAsync()
PgxFuture<PgxEdge>	PgxGraph.getEdgeAsync(long id) Looks up a PgxEdge of this graph by ID.
PgxFuture<EdgeLabel>	PgxGraph.getEdgeLabelAsync() Get the edge labels belonging to this graph.
PgxFuture<java.util.Set<EdgeProperty<?>>>	PgxGraph.getEdgePropertiesAsync() Get the set of edge properties belonging to this graph.
<V> PgxFuture<EdgeProperty<V>>	PgxGraph.getEdgePropertyAsync(java.lang.String name) Gets an edge property of this graph
PgxFuture<EdgeSet>	PgxGraph.getEdgesAsync() Creates a new edge set containing all edges.
<E> PgxFuture<EdgeSet>	PgxGraph.getEdgesAsync(EdgeFilter filter) Creates a new edge set containing edges according to the given filter expression.
PgxFuture<VertexProperty<ID,java.lang.Double>>	MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex<ID> estimateRatingsFor) Computes estimated ratings for a specific vertex.
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo>	ServerInstance.getGraphInfoAsync(java.lang.String graphName) Get details of a (shared) persistent graph
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo>	ServerInstance.getGraphInfoAsync(java.lang.String sessionId, java.lang.String graphName) Get details of a session-bound, private graph
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.GraphInfo>>	ServerInstance.getGraphInfosAsync() Get a list of currently active graphs.
PgxFuture<java.lang.Iterable<PgxEdge>>	PgxVertex.getInEdgesAsync() Returns all incoming edges of this node.
PgxFuture<java.lang.Iterable<PgxVertex<ID>>>	PgxVertex.getInNeighborsAsync() Returns all incoming neighbors of this node, i.e.
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>>	BipartiteGraph.getIsLeftPropertyAsync() Gets the 'is Left' vertex property of the graph.
PgxFuture<java.lang.String>	PgxEdge.getLabelAsync() Gets the label.
PgxFuture<java.util.Set<java.lang.String>>	PgxVertex.getLabelsAsync() Gets the labels
PgxFuture<oracle.pgx.common.pojo.admin.MemoryInfo>	ServerInstance.getMemoryInfoAsync() Gets the memory info.
PgxFuture<java.lang.Iterable<PgxEdge>>	PgxVertex.getOutEdgesAsync() Returns all outgoing edges of this node.
PgxFuture<java.lang.Iterable<PgxVertex<ID>>>	PgxVertex.getOutNeighborsAsync() Returns all outgoing neighbors of this node, i.e.
PgxFuture<java.util.Map<oracle.pgx.config.PgxConfig.Field,java.lang.Object>>	ServerInstance.getPgxConfigAsync() Gets the PGX config.
PgxFuture<java.lang.String>	ServerInstance.getPgxVersionAsync() Gets the PGX version of this instance.
<V> PgxFuture<V>	PgxEntity.getPropertyAsync(java.lang.String propertyName) Gets the value of a property.
PgxFuture<oracle.pgx.common.pojo.admin.SessionInfo>	ServerInstance.getSessionInfoAsync(java.lang.String sessionId) Gets the session info.
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.SessionInfo>>	ServerInstance.getSessionInfosAsync() Gets the session infos.
<ID> PgxFuture<PgxVertex<ID>>	PgxEdge.getSourceAsync()
PgxFuture<oracle.pgx.common.pojo.admin.PoolInfo>	ServerInstance.getThreadPoolInfoAsync(PoolType type) Gets the thread pool info.
PgxFuture<EntryIterable<ID,K,V>>	Property.getTopKValuesAsync(int k) Gets the top k vertex/edge value pairs according to their value.
PgxFuture<EntryIterable<ID,K,V>>	Property.getValuesAsync() Gets the values.
<ID> PgxFuture<PgxVertex<ID>>	PgxGraph.getVertexAsync(ID id) Looks up a PgxVertex of this graph by ID.
<ID> PgxFuture<VertexLabels<ID>>	PgxGraph.getVertexLabelsAsync() Get the vertex labels belonging to this graph.
PgxFuture<java.util.Set<VertexProperty<?,?>>>	PgxGraph.getVertexPropertiesAsync() Get the set of vertex properties belonging to this graph.
<ID,V> PgxFuture<VertexProperty<ID,V>>	PgxGraph.getVertexPropertyAsync(java.lang.String name) Gets a vertex property of this graph
<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.
PgxFuture<java.lang.Boolean>	PgxGraph.hasEdgeAsync(long id) Looks up whether the graph has an Edge with the given ID
<ID> PgxFuture<java.lang.Boolean>	PgxGraph.hasVertexAsync(ID id) Looks up whether the graph has a Vertex with the given ID
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>>	Analyst.hitsAsync(PgxGraph graph, int max) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<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) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<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) This is the Hyperlink-Induced Topic Search (HITS) algorithm, also known as Hubs and Authorities..
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.inDegreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the in-degree.
<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) Compute vertex centrality based on the in-degree.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph) Computes the indegree distribution of the given graph and stores it in a map.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Computes the indegree distribution of the given graph and stores it in a map.
<ID> PgxFuture<java.lang.Boolean>	PgxGraph.isBipartiteGraphAsync(VertexProperty<ID,java.lang.Boolean> isLeft) Checks whether a given graph is a bipartite graph.
PgxFuture<java.lang.Boolean>	ServerInstance.isEngineRunningAsync() Check if the engine is currently up
PgxFuture<java.lang.Boolean>	PgxGraph.isFreshAsync() Check whether an in-memory representation of a graph is fresh.
PgxFuture<java.lang.Boolean>	PgxCollection.isMutableAsync() Checks whether an existing vertex/edge collection is mutable
PgxFuture<java.util.Iterator<E>>	PgxCollection.iteratorAsync() Gets an Iterator over the collection.
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph) Computes the k-core decomposition of the graph.
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>>	Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore) Computes the k-core decomposition of the graph.
<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) Computes the k-core decomposition of the graph.
<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) Computes the k-core decomposition of the graph.
PgxFuture<java.lang.Iterable<K>>	PgxMap.keysAsync()
PgxFuture<java.lang.Void>	ServerInstance.killSessionAsync(java.lang.String sessionId) Kill a session.
PgxFuture<GraphConfig>	ServerInstance.lookupPreloadedGraphAsync(java.lang.String name) Looks up the config of a pre-loaded graph by name.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, VertexProperty<ID,PgxVect<java.lang.Double>> features) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>>	Analyst.outDegreeCentralityAsync(PgxGraph graph) Compute vertex centrality based on the out-degree.
<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) Compute vertex centrality based on the out-degree.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph) Computes the outdegree distribution of the given graph and stores it in a map.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Computes the outdegree distribution of the given graph and stores it in a map.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) Computes an approximate pagerank.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) Classic pagerank algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) Classic pagerank algorithm.
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>>	Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition) Compute the average and minimum conductance among all partitions in a vertex partition.
<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) Compute the average and minimum conductance among all partitions in a vertex partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition) Compute the modularity of a partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> modularity) Compute the modularity of a partition.
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition, java.lang.String modularityName)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v) Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, 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 vertex v.
<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 (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, 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 vertex v.
<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> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank) Personalized SALSA computes recommendations ith respect to a given vertex v.
<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> PgxFuture<PgxVertex<ID>>	PgxGraph.pickRandomVertexAsync() Picks a random vertex in the graph.
PgxFuture<PgqlResultSet>	PgxGraph.queryPgqlAsync(java.lang.String pgqlString) Submits a pattern matching query.
PgxFuture<PgqlResultSet>	PgxGraph.queryPgqlAsync(java.lang.String pgqlString, PatternMatchingSemantic patternMatchingSemantic) Submits a pattern matching query.
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>>	Analyst.radiusAsync(PgxGraph graph) Computes the radius of the (undirected) 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) Computes the radius of the (undirected) graph.
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 file 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.readGraphWithPropertiesAsync(GraphConfig config) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean updateIfNotFresh) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean updateIfNotFresh, java.lang.String newGraphName) Reads a graph and its properties, specified a graph config, into memory.
PgxFuture<PgxGraph>	PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit) Reads a graph and its properties, specified a 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 a 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<java.lang.Void>	PgxCollection.removeAllAsync(java.util.Collection<E> source) Remove vertices/edges from an existing vertex/edge collection
PgxFuture<java.lang.Boolean>	PgxMap.removeAsync(K key) Removes the entry specified by the given key from the map with the given name.
PgxFuture<java.lang.Void>	Property.renameAsync(java.lang.String newPropertyName) Renames this property.
PgxFuture<java.lang.Void>	ServerInstance.resizePoolAsync(PoolType poolType, int parallelism) Resize a pool to use a different degree of parallelism
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.salsaAsync(BipartiteGraph graph, int k) Convenience method around Analyst.salsaAsync(BipartiteGraph, int, double, double, int) using maxDiff = 0.01 d = 0.85 maxIter = 1000
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter) SALSA recommendation algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<Partition<ID>>	Analyst.sccKosarajuAsync(PgxGraph graph) Find strongly connected components using Kosaraju's algorithm.
<ID> PgxFuture<Partition<ID>>	Analyst.sccKosarajuAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Find strongly connected components using Kosaraju's algorithm.
<ID> PgxFuture<Partition<ID>>	Analyst.sccTarjanAsync(PgxGraph graph) Find strongly connected components using Tarjan's algorithm.
<ID> PgxFuture<Partition<ID>>	Analyst.sccTarjanAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) Find strongly connected components using Tarjan's algorithm.
PgxFuture<java.lang.Void>	Property.setAsync(K key, V value) Sets a property value.
PgxFuture<java.lang.Void>	PgxMap.setAsync(K key, V value) Sets the value for a key in the map specified by the given name.
PgxFuture<java.lang.Void>	Scalar.setAsync(V value) Sets the scalar value.
<V> PgxFuture<java.lang.Void>	PgxEntity.setPropertyAsync(java.lang.String propertyName, V value) Sets the value of a property.
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.
PgxFuture<java.lang.Void>	Property.setValuesAsync(java.util.Map<K,V> values) Sets multiple property values.
PgxFuture<java.lang.Void>	Property.setValuesAsync(java.util.Map<K,V> values, V defaultValue) Sets multiple property values.
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Compute single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<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) Compute single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) Compute reverse single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<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) Compute reverse single source shortest paths using Bellman & Ford algorithm Time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Compute shortest path using Dijkstra's algorithm.
<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) Compute shortest path using Dijkstra's algorithm.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) Compute shortest path using a bi-directional Dijkstra variant.
<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) Compute shortest path using a bi-directional Dijkstra variant.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<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) Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
<ID> PgxFuture<PgxPath<ID>>	Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
<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) Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src) Compute hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of 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) Compute hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of graph
<ID> PgxFuture<AllPaths<ID>>	Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src) Compute reverse hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of 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) Compute reverse hop-distance from given vertex to every other vertex Time complexity: O(E * d) with E = number of edges, d = diameter of graph
PgxFuture<java.lang.Boolean>	ServerInstance.shutdownEngineAsync(long timeout, java.util.concurrent.TimeUnit unit) Gracefully shuts down the engine and cleans up resources.
PgxFuture<java.lang.Void>	ServerInstance.shutdownEngineNowAsync() Forces the engine to stop and clean up resources.
PgxFuture<java.lang.Void>	ServerInstance.shutdownEngineNowIfRunningAsync() If the engine is currently up forces it to stop and clean up resources.
PgxFuture<PgxGraph>	PgxGraph.simplifyAsync() Convenience method around PgxGraph.simplifyAsync(String) passing null as graphName
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(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Convenience method for PgxGraph.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 PgxGraph.simplifyAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing MultiEdges as MultiEdges.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<java.lang.Integer>	PgxCollection.sizeAsync() Gets the number of elements in this collection
PgxFuture<java.lang.Long>	Property.sizeAsync() Gets the size/length of this property.
PgxFuture<java.lang.Integer>	PgxMap.sizeAsync() Returns the size of the map
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 PgxGraph.sparsify(double, String) Passing newGraphName as null
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 PgxGraph.sparsify(Collection, Collection, double, String) Passing vertexProps as VertexProperty.ALL edgeProps as EdgeProperty.ALL
PgxFuture<java.lang.Void>	ServerInstance.startEngineAsync() Starts the PGX engine.
PgxFuture<java.lang.Void>	ServerInstance.startEngineAsync(java.io.InputStream config) Starts the PGX engine with a custom configuration.
PgxFuture<java.lang.Void>	ServerInstance.startEngineAsync(java.util.Map<oracle.pgx.config.PgxConfig.Field,java.lang.Object> config) Starts the PGX engine with a custom configuration.
PgxFuture<java.lang.Void>	ServerInstance.startEngineAsync(java.lang.String path) Starts the PGX engine with a custom configuration given as path.
PgxFuture<oracle.pgx.config.SingleFileGraphConfig>	PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath) Stores this graph in a given file format on a file system.
PgxFuture<oracle.pgx.config.SingleFileGraphConfig>	PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath, boolean overwrite) Stores this graph in a given file format on a file system.
PgxFuture<oracle.pgx.config.SingleFileGraphConfig>	PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath, java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, boolean overwrite) Stores this graph in a given file format on a file system.
PgxFuture<GraphConfig>	PgxGraph.storeAsync(GraphConfig targetConfig, boolean overwrite) Stores this graph in a file or database.
PgxFuture<java.lang.Void>	PgxFuture.thenAccept(java.util.function.Consumer<? super T> block)
<U> PgxFuture<U>	PgxFuture.thenApply(java.util.function.Function<? super T,? extends U> function)
<U> PgxFuture<U>	PgxFuture.thenApplyAsync(java.util.function.Function<? super T,? extends U> function, java.util.concurrent.Executor executor)
<U,V> PgxFuture<V>	PgxFuture.thenCombine(java.util.concurrent.CompletableFuture<? extends U> other, java.util.function.BiFunction<? super T,? super U,? extends V> function)
PgxFuture<T>	PgxFuture.thenComplete(PgxFuture<T> promise) completes the given promise whenever this completes.
PgxFuture<T>	PgxFuture.thenComplete(PgxFuture<T> promise, java.lang.Runnable cleanup) completes the given promise whenever this completes.
<U> PgxFuture<U>	PgxFuture.thenCompose(java.util.function.Function<? super T,? extends java.util.concurrent.CompletionStage<U>> function)
PgxFuture<PgxCollection<E,ID>>	PgxCollection.toMutableAsync() Create a mutable copy of an existing vertex/edge collection Convenience method around PgxCollection.toMutableAsync(String) passing name as null
PgxFuture<PgxCollection<E,ID>>	PgxCollection.toMutableAsync(java.lang.String newName) Create a mutable copy of an existing vertex/edge collection
PgxFuture<PgxGraph>	PgxGraph.undirectAsync() Convenience method around PgxGraph.undirectAsync(String) passing null as graphName
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Create an undirected version of a graph.
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName) Convenience method for PgxGraph.undirectAsync(Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing Collection(vertexProps) as VertexProperty.ALL
PgxFuture<PgxGraph>	PgxGraph.undirectAsync(java.lang.String newGraphName) Convenience method around PgxGraph.undirectAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String) Passing MultiEdges as MultiEdges.KEEP_MULTI_EDGES SelfEdges as SelfEdges.KEEP_SELF_EDGES Trivial Vertices as TrivialVertices.KEEP_TRIVIALVERTICES Mode as Mode.CREATE_COPY
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph) Compute vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc) Compute vertex betweenness centrality (without considering edge length).
<ID> PgxFuture<Partition<ID>>	Analyst.wccAsync(PgxGraph graph) Find weakly connected components through label propagation Time complexity: O(E * D) with E = number of edges, D = diameter of the graph
<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> partitonDistribution) Find weakly connected components through label propagation Time complexity: O(E * D) with E = number of edges, D = diameter of the graph
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<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) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) Weighted PageRank - like the original PageRank algorithm, except that each edge has a weight value assigned to it.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double) using max = 100 circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double) using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff) The Who to Follow recommendation algorithm by Twitter, Inc.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff, VertexSequence<ID> hubs, VertexSequence<ID> authorities) The Who to Follow recommendation algorithm by Twitter, Inc.
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double, VertexSequence, VertexSequence) using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities) Convenience method around Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double, VertexSequence, VertexSequence) using circleOfTrustSize = 100 circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01

Methods in oracle.pgx.api with parameters of type PgxFuture

Modifier and Type	Method and Description
PgxFuture<T>	PgxFuture.cancelOn(PgxFuture promise) If given promise completes exceptionally because it was canceled, cancel() gets called on this promise as well.
PgxFuture<T>	PgxFuture.thenComplete(PgxFuture<T> promise) completes the given promise whenever this completes.
PgxFuture<T>	PgxFuture.thenComplete(PgxFuture<T> promise, java.lang.Runnable cleanup) completes the given promise whenever this completes.

Method parameters in oracle.pgx.api with type arguments of type PgxFuture

Modifier and Type	Method and Description
static <T> PgxFuture<java.lang.Void>	PgxFuture.allOf(java.util.List<PgxFuture<T>> promises)

Uses of PgxFuture in oracle.pgx.api.admin

Methods in oracle.pgx.api.admin that return PgxFuture

Modifier and Type	Method and Description
PgxFuture<java.lang.Void>	Control.addPinnedGraph(GraphConfig cfg) Add a pinned graph (will not be unloaded by engine) to be shared between sessions
PgxFuture<java.lang.Void>	Control.demotePinnedGraph(GraphConfig cfg) Demote pinned graph.
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo>	Control.getGraphInfo(java.lang.String graphName) Get details of a (shared) persistent graph
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo>	Control.getGraphInfo(java.lang.String sessionId, java.lang.String graphName) Get details of a session-bound, private graph
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.GraphInfo>>	Control.getGraphInfos() Get a list of currently active graphs.
PgxFuture<oracle.pgx.common.pojo.admin.MemoryInfo>	Control.getMemoryInfo() Gets the memory info.
PgxFuture<java.util.Map<oracle.pgx.config.PgxConfig.Field,java.lang.Object>>	Control.getPgxConfig() Gets the pgx config.
PgxFuture<oracle.pgx.common.pojo.admin.SessionInfo>	Control.getSessionInfo(java.lang.String sessionId) Gets the session info.
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.SessionInfo>>	Control.getSessionInfos() Gets the session infos.
PgxFuture<oracle.pgx.common.pojo.admin.PoolInfo>	Control.getThreadPoolInfo(PoolType type) Gets the thread pool info.
PgxFuture<java.lang.String>	Control.getVersion()
PgxFuture<java.lang.Boolean>	Control.isRunning() Check if the engine is currently up
PgxFuture<java.lang.Void>	Control.killSession(java.lang.String sessionId) Kill session.
PgxFuture<GraphConfig>	Control.lookupPreloadedGraph(java.lang.String name) look up the config of a pre-loaded graph by name.
PgxFuture<java.lang.Void>	Control.resizePool(PoolType poolType, int parallelism) resize a pool to use a different degree of parallelism
PgxFuture<java.lang.Boolean>	Control.shutdown(long timeout, java.util.concurrent.TimeUnit unit) gracefully shuts down the engine and cleans up resources.
PgxFuture<java.lang.Void>	Control.shutdownNow() forces the engine to stop and clean up resources.
PgxFuture<java.lang.Void>	Control.shutdownNowIfRunning()
PgxFuture<java.lang.Void>	Control.start()
PgxFuture<java.lang.Void>	Control.start(java.io.InputStream config)
PgxFuture<java.lang.Void>	Control.start(java.util.Map<oracle.pgx.config.PgxConfig.Field,java.lang.Object> config)
PgxFuture<java.lang.Void>	Control.start(java.lang.String json)