Uses of Class oracle.pgx.api.PgxGraph (Oracle Big Data Spatial and Graph Property Graph)

Packages that use PgxGraph
Package Description

oracle.pgx.api
This package contains the Java APIs of PGX.

Packages that use PgxGraph
Package	Description
oracle.pgx.api	This package contains the Java APIs of PGX.

Uses of PgxGraph in oracle.pgx.api

Subclasses of PgxGraph in oracle.pgx.api
Modifier and Type	Class and Description
`class`	`BipartiteGraph` A bipartite `PgxGraph`.

Methods in oracle.pgx.api that return PgxGraph
Modifier and Type	Method and Description
`PgxGraph`	PgxGraph.`clone()` Blocking version of `cloneAsync()`.
`PgxGraph`	PgxGraph.`clone(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName)` Blocking version of `cloneAsync()`.
`PgxGraph`	PgxGraph.`clone(String newGraphName)` Blocking version of `cloneAsync()`.
`PgxGraph`	PgxGraph.`filter(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)` Blocking version of `#filterAsync()`.
`PgxGraph`	PgxGraph.`filter(GraphFilter graphFilter)` Blocking version of `#filterAsync()`.
`PgxGraph`	PgxGraph.`filter(GraphFilter graphFilter, String newGraphName)` Blocking version of `#filterAsync()`.
`PgxGraph`	PgxMap.`getGraph()` Gets the PgxGraph this map is bound to.
`PgxGraph`	Partition.`getGraph()`
`PgxGraph`	PgxPath.`getGraph()` Gets the PgxGraph the Path is defined on.
`PgxGraph`	Property.`getGraph()`
`PgxGraph`	Scalar.`getGraph()` Gets the graph the scalar is bound to.
`PgxGraph`	PgxCollection.`getGraph()` Gets the graph.
`PgxGraph`	PgxEntity.`getGraph()` Gets the graph.
`PgxGraph`	AllPaths.`getGraph()` Gets the graph.
`PgxGraph`	PgxSession.`readGraphWithProperties(GraphConfig config)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(GraphConfig)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(GraphConfig config, boolean forceUpdateIfNotFresh)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(GraphConfig, boolean)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(GraphConfig config, boolean forceUpdateIfNotFresh, String newGraphName)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(GraphConfig, boolean, String)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(GraphConfig config, long maxAge, TimeUnit maxAgeTimeUnit)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(GraphConfig, long, TimeUnit)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(GraphConfig config, long maxAge, TimeUnit maxAgeTimeUnit, boolean blockIfFull, String newGraphName)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(GraphConfig, long, TimeUnit, boolean, String)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(GraphConfig config, String newGraphName)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(GraphConfig, String)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(String path)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(String)`.
`PgxGraph`	PgxSession.`readGraphWithProperties(String path, String newGraphName)` Blocking version of `PgxSession.readGraphWithPropertiesAsync(String, String)`.
`PgxGraph`	PgxGraph.`simplify(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)` Blocking version of `#simplifyAsync()`.
`PgxGraph`	PgxGraph.`simplify(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)` Blocking version of `#simplifyAsync()`.
`PgxGraph`	PgxGraph.`sortByDegree()` Blocking version of `sortByDegreeAsync()`.
`PgxGraph`	PgxGraph.`sortByDegree(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)` Blocking version of `sortByDegreeAsync()`.
`PgxGraph`	PgxGraph.`sortByDegree(PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)` Blocking version of `sortByDegreeAsync()`.
`PgxGraph`	PgxGraph.`sortByDegree(String newGraphName)` Blocking version of `sortByDegreeAsync()`.
`PgxGraph`	PgxGraph.`sparsify(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, String newGraphName)` Blocking version of `#sparsifyAsync()`.
`PgxGraph`	PgxGraph.`sparsify(double e)` Blocking version of `#sparsifyAsync()`.
`PgxGraph`	PgxGraph.`sparsify(double e, String newGraphName)` Blocking version of `#sparsifyAsync()`.
`PgxGraph`	PgxGraph.`undirect()` Blocking version of `undirectAsync()`.
`PgxGraph`	PgxGraph.`undirect(Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)` Blocking version of `undirectAsync()`.
`PgxGraph`	PgxGraph.`undirect(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, String newGraphName)` Blocking version of `undirectAsync()`.
`PgxGraph`	PgxGraph.`undirect(String newGraphName)` Blocking version of `undirectAsync()`.

Methods in oracle.pgx.api that return types with arguments of type PgxGraph
Modifier and Type	Method and Description
`PgxFuture<PgxGraph>`	PgxGraph.`cloneAsync()` Convenience method of `cloneAsync(String)` Passing String(name) as `null` Create a copy of a graph.
`PgxFuture<PgxGraph>`	PgxGraph.`cloneAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, String newGraphName)` Create a copy of a graph.
`PgxFuture<PgxGraph>`	PgxGraph.`cloneAsync(String newGraphName)` Convenience method of `cloneAsync(Collection, Collection, String)` Passing Collection(vertexProperties) as `VertexProperty.ALL` Collection(edgeProperties) as `EdgeProperty.ALL` Create a copy of a graph.
`PgxFuture<PgxGraph>`	PgxGraph.`filterAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, String newGraphName)` Create a subgraph of a graph.
`PgxFuture<PgxGraph>`	PgxGraph.`filterAsync(GraphFilter graphFilter)` Create a subgraph of a graph.
`PgxFuture<PgxGraph>`	PgxGraph.`filterAsync(GraphFilter graphFilter, String newGraphName)` Create a subgraph of a graph.
`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 forceUpdateIfNotFresh)` Reads a graph and its properties, specified a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxSession.`readGraphWithPropertiesAsync(GraphConfig config, boolean forceUpdateIfNotFresh, String newGraphName)` Reads a graph and its properties, specified a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxSession.`readGraphWithPropertiesAsync(GraphConfig config, long maxAge, TimeUnit maxAgeTimeUnit)` Reads a graph and its properties, specified a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxSession.`readGraphWithPropertiesAsync(GraphConfig config, long maxAge, TimeUnit maxAgeTimeUnit, boolean blockIfFull, String newGraphName)` Reads a graph and its properties, specified a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxSession.`readGraphWithPropertiesAsync(GraphConfig config, String newGraphName)` Reads a graph and its properties, specified a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxSession.`readGraphWithPropertiesAsync(String path)` Reads a graph and its properties, specified by a path to a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxSession.`readGraphWithPropertiesAsync(String path, String newGraphName)` Reads a graph and its properties, specified by a path to a graph config, into memory.
`PgxFuture<PgxGraph>`	PgxGraph.`simplifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, 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, String newGraphName)` Convenience method for `simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String)` Passing Collection(vertexProperties) as `VertexProperty.ALL` Collection(edgeProperties) as `EdgeProperty.ALL` Create a simplified version of a graph.
`PgxFuture<PgxGraph>`	PgxGraph.`sortByDegreeAsync()` Create a sorted version of a graph and all its properties.
`PgxFuture<PgxGraph>`	PgxGraph.`sortByDegreeAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)` Create a sorted version of a graph and all its properties.
`PgxFuture<PgxGraph>`	PgxGraph.`sortByDegreeAsync(PgxGraph.Direction direction, PgxGraph.Degree degree, PgxGraph.Mode mode, String newGraphName)` Create a sorted version of a graph and all its properties.
`PgxFuture<PgxGraph>`	PgxGraph.`sortByDegreeAsync(String newGraphName)` Create a sorted version of a graph and all its properties.
`PgxFuture<PgxGraph>`	PgxGraph.`sparsifyAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, double e, 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 `sparsify(double, String)` Passing newGraphName as `null`
`PgxFuture<PgxGraph>`	PgxGraph.`sparsifyAsync(double e, String newGraphName)` Sparsifies the given graph and returns a new graph with less edges. Convenience method around `sparsify(Collection, Collection, double, String)` Passing vertexProps as `VertexProperty.ALL` edgeProps as `EdgeProperty.ALL`
`PgxFuture<PgxGraph>`	PgxGraph.`undirectAsync()` Convenience method around `undirectAsync(String)` Passing String(newGraphName) as null
`PgxFuture<PgxGraph>`	PgxGraph.`undirectAsync(Collection<VertexProperty<?,?>> vertexProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, 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, String newGraphName)` Convenience method for `undirectAsync(Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String)` Passing Collection(vertexProps) as `VertexProperty.ALL`
`PgxFuture<PgxGraph>`	PgxGraph.`undirectAsync(String newGraphName)` Convenience method around `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`

Methods in oracle.pgx.api with parameters of type PgxGraph
Modifier and Type	Method and Description
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`approximateVertexBetweennessCentrality(PgxGraph graph, int k)` Blocking version of `#approximateVertexBetweennessCentralityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k)` Approximate vertex betweenness centrality (without considering edge length).
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds)` Blocking version of `#approximateVertexBetweennessCentralityFromSeedsAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds)` Approximate vertex betweenness centrality (without considering edge length).
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`closenessCentralityDoubleLength(PgxGraph graph, EdgeProperty<Double> cost)` Blocking version of `#closenessCentralityDoubleLengthAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<Double> cost)` Compute closed centrality.
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`closenessCentralityUnitLength(PgxGraph graph)` Blocking version of `#closenessCentralityUnitLengthAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`closenessCentralityUnitLengthAsync(PgxGraph graph)` Compute closed centrality.
`<ID extends Comparable<ID>> Partition<ID>`	Analyst.`communitiesLabelPropagation(PgxGraph graph)` Blocking version of `#communitiesLabelPropagationAsync()`.
`<ID extends Comparable<ID>> PgxFuture<Partition<ID>>`	Analyst.`communitiesLabelPropagationAsync(PgxGraph graph)` Detect communities using parallel label propagation.
`long`	Analyst.`countTriangles(PgxGraph graph, boolean sortVerticesByDegree)` Blocking version of `#countTrianglesAsync()`.
`PgxFuture<Long>`	Analyst.`countTrianglesAsync(PgxGraph graph, boolean sortVerticesByDegree)` Counts the number of 'triads' in the given undirected graph.
`<ID extends Comparable<ID>> VertexProperty<ID,Integer>`	Analyst.`degreeCentrality(PgxGraph graph)` Blocking version of `#degreeCentralityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Integer>>`	Analyst.`degreeCentralityAsync(PgxGraph graph)` Compute degree centrality.
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`eigenvectorCentrality(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)` Blocking version of `#eigenvectorCentralityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge)` Compute eigenvector centrality using power iteration (with L1 norm).
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`fattestPath(PgxGraph graph, ID rootId, EdgeProperty<Double> capacity)` Convenience wrapper around `Analyst.fattestPath(PgxGraph, PgxVertex, EdgeProperty)` taking a vertex ID instead of a `PgxVertex`.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)` Blocking version of `#fattestPathAsync()`.
`<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>`	Analyst.`fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)` Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
`Deque<GraphMetaData>`	PgxSession.`getAvailableSnapshots(PgxGraph snapshot)` Blocking version of `PgxSession.getAvailableSnapshotsAsync(PgxGraph)`.
`PgxFuture<Deque<GraphMetaData>>`	PgxSession.`getAvailableSnapshotsAsync(PgxGraph snapshot)` Gets a list of available in-memory snapshots of a given snapshot.
`<ID extends Comparable<ID>> Pair<VertexProperty<ID,Double>,VertexProperty<ID,Double>>`	Analyst.`hits(PgxGraph graph, int max)` Blocking version of `#hitsAsync()`.
`<ID extends Comparable<ID>> PgxFuture<Pair<VertexProperty<ID,Double>,VertexProperty<ID,Double>>>`	Analyst.`hitsAsync(PgxGraph graph, int max)` Classic HITS algorithm (Hyperlink-Induced Topic Search, aka.
`<ID extends Comparable<ID>> VertexProperty<ID,Integer>`	Analyst.`inDegreeCentrality(PgxGraph graph)` Blocking version of `#inDegreeCentralityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Integer>>`	Analyst.`inDegreeCentralityAsync(PgxGraph graph)` Compute in-degree centrality.
`PgxMap<Integer,Long>`	Analyst.`inDegreeDistribution(PgxGraph graph)` Blocking version of `#inDegreeDistributionAsync()`.
`PgxFuture<PgxMap<Integer,Long>>`	Analyst.`inDegreeDistributionAsync(PgxGraph graph)` Computes the indegree distribution of the given graph and stores it in a map.
`<ID extends Comparable<ID>> VertexProperty<ID,Integer>`	Analyst.`outDegreeCentrality(PgxGraph graph)` Blocking version of `#outDegreeCentralityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Integer>>`	Analyst.`outDegreeCentralityAsync(PgxGraph graph)` Compute out-degree centrality.
`PgxMap<Integer,Long>`	Analyst.`outDegreeDistribution(PgxGraph graph)` Blocking version of `#outDegreeDistributionAsync()`.
`PgxFuture<PgxMap<Integer,Long>>`	Analyst.`outDegreeDistributionAsync(PgxGraph graph)` Computes the outdegree distribution of the given graph and stores it in a map.
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`pagerank(PgxGraph graph, double e, double d, int max)` Blocking version of `#pagerankAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`pagerankAsync(PgxGraph graph, double e, double d, int max)` Classic pagerank algorithm.
`<ID extends Comparable<ID>> Pair<Scalar<Double>,Scalar<Double>>`	Analyst.`partitionConductance(PgxGraph graph, Partition<ID> components)` Blocking version of `#partitionConductanceAsync()`.
`<ID extends Comparable<ID>> PgxFuture<Pair<Scalar<Double>,Scalar<Double>>>`	Analyst.`partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)` Compute the conductance of a partition.
`<ID extends Comparable<ID>> Scalar<Double>`	Analyst.`partitionModularity(PgxGraph graph, Partition<ID> components)` Blocking version of `#partitionModularityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<Scalar<Double>>`	Analyst.`partitionModularityAsync(PgxGraph graph, Partition<ID> partition)` Compute the modularity of a partition.
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`personalizedPagerank(PgxGraph graph, ID vertexId, double e, double d, int max)` Convenience wrapper around `Analyst.personalizedPagerank(PgxGraph, PgxVertex, double, double, int)` taking a vertex ID instead of a `PgxVertex`.
`<ID extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)` Blocking version of `Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int)`.
`<ID extends Comparable<ID>> VertexProperty<ID,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 extends Comparable<ID>> PgxFuture<VertexProperty<ID,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 extends Comparable<ID>> PgxFuture<VertexProperty<ID,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 extends Comparable<ID>> Partition<ID>`	Analyst.`sccKosaraju(PgxGraph graph)` Blocking version of `#sccKosarajuAsync()`.
`<ID extends Comparable<ID>> PgxFuture<Partition<ID>>`	Analyst.`sccKosarajuAsync(PgxGraph graph)` Find strongly connected components using Kosaraju's algorithm.
`<ID extends Comparable<ID>> Partition<ID>`	Analyst.`sccTarjan(PgxGraph graph)` Blocking version of `#sccTarjanAsync()`.
`<ID extends Comparable<ID>> PgxFuture<Partition<ID>>`	Analyst.`sccTarjanAsync(PgxGraph graph)` Find strongly connected components using Tarjan's algorithm.
`void`	PgxSession.`setSnapshot(PgxGraph graph, GraphMetaData metaData)` Blocking version of `PgxSession.setSnapshotAsync(PgxGraph, GraphMetaData)`.
`void`	PgxSession.`setSnapshot(PgxGraph graph, GraphMetaData metaData, boolean forceDeleteProperties)` Blocking version of `PgxSession.setSnapshotAsync(PgxGraph, GraphMetaData, boolean)`.
`void`	PgxSession.`setSnapshot(PgxGraph graph, long creationTimestamp)` Blocking version of `PgxSession.setSnapshotAsync(PgxGraph, long)`.
`void`	PgxSession.`setSnapshot(PgxGraph graph, long creationTimestamp, boolean forceDeleteProperties)` Blocking version of `PgxSession.setSnapshotAsync(PgxGraph, long, boolean)`.
`PgxFuture<Void>`	PgxSession.`setSnapshotAsync(PgxGraph graph, GraphMetaData metaData)` Sets a graph to a specific snapshot.
`PgxFuture<Void>`	PgxSession.`setSnapshotAsync(PgxGraph graph, GraphMetaData metaData, boolean forceDeleteTransientProperties)` Sets a graph to a specific snapshot.
`PgxFuture<Void>`	PgxSession.`setSnapshotAsync(PgxGraph graph, long creationTimestamp)` Sets a graph to a specific snapshot.
`PgxFuture<Void>`	PgxSession.`setSnapshotAsync(PgxGraph graph, long creationTimestamp, boolean forceDeleteTransientProperties)` Sets a graph to a specific snapshot.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathBellmanFord(PgxGraph graph, ID srcId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathBellmanFord(PgxGraph, PgxVertex, EdgeProperty)` taking a vertex ID instead of `PgxVertex`.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Blocking version of `#shortestPathBellmanFordAsync()`.
`<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>`	Analyst.`shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<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 extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathBellmanFordReverse(PgxGraph graph, ID srcId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathBellmanFordReverse(PgxGraph, PgxVertex, EdgeProperty)` taking a vertex ID instead of `PgxVertex`.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Blocking version of `#shortestPathBellmanFordReverseAsync()`.
`<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>`	Analyst.`shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<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 extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)` taking vertex IDs instead of `PgxVertex`.
`<ID extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraAsync()`.
`<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>`	Analyst.`shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using Dijkstra's algorithm.
`<ID extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost)` Convenience wrapper around `Analyst.shortestPathDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty)` taking vertex IDs instead of `PgxVertex`.
`<ID extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraBidirectionalAsync()`.
`<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>`	Analyst.`shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using a bi-directional Dijkstra variant.
`<ID extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr)` Convenience wrapper around `Analyst.shortestPathFilteredDijkstra(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)` taking vertex IDs instead of `PgxVertex`.
`<ID extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraAsync()`.
`<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>`	Analyst.`shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<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 extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, ID srcId, ID dstId, EdgeProperty<Double> cost, GraphFilter filterExpr)` Convenience wrapper around `Analyst.shortestPathFilteredDijkstraBidirectional(PgxGraph, PgxVertex, PgxVertex, EdgeProperty, GraphFilter)` taking vertex IDs instead of `PgxVertex`.
`<ID extends Comparable<ID>> PgxPath<ID>`	Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraBidirectionalAsync()`.
`<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>`	Analyst.`shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathHopDist(PgxGraph graph, ID srcId)` Convenience wrapper around `Analyst.shortestPathHopDist(PgxGraph, PgxVertex)` taking a vertex ID instead of `PgxVertex`.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src)` Blocking version of `#shortestPathHopDistAsync()`.
`<ID extends Comparable<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 extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathHopDistReverse(PgxGraph graph, ID srcId)` Convenience wrapper around `Analyst.shortestPathHopDistReverse(PgxGraph, PgxVertex)` taking a vertex ID instead of `PgxVertex`.
`<ID extends Comparable<ID>> AllPaths<ID>`	Analyst.`shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src)` Blocking version of `#shortestPathHopDistReverseAsync()`.
`<ID extends Comparable<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 extends Comparable<ID>> VertexProperty<ID,Double>`	Analyst.`vertexBetweennessCentrality(PgxGraph graph)` Blocking version of `#vertexBetweennessCentralityAsync()`.
`<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>`	Analyst.`vertexBetweennessCentralityAsync(PgxGraph graph)` Compute vertex betweenness centrality (without considering edge length).
`<ID extends Comparable<ID>> Partition<ID>`	Analyst.`wcc(PgxGraph graph)` Blocking version of `#wccAsync()`.
`<ID extends Comparable<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 extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>`	Analyst.`whomToFollow(PgxGraph graph, ID vertexId, int max)` Convenience wrapper around `Analyst.whomToFollow(PgxGraph, PgxVertex, int)` taking a vertex ID instead of a `PgxVertex`.
`<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>`	Analyst.`whomToFollow(PgxGraph graph, ID vertexId, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Convenience wrapper around `Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, double, double, int, double)` taking a vertex ID instead of a `PgxVertex`.
`<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>`	Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int)`.
`<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>`	Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)`.
`<ID extends Comparable<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 extends Comparable<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.