Uses of Class
oracle.pgx.api.PgxMap

Packages that use PgxMap

Package	Description
oracle.pgx.api	This package contains the main Java APIs.

Uses of PgxMap in oracle.pgx.api

Methods in oracle.pgx.api that return PgxMap

Modifier and Type	Method and Description
<K,V> PgxMap<K,V>	PgxGraph.createMap(PropertyType keyType, PropertyType valType) Blocking version of PgxGraph.createMapAsync(PropertyType, PropertyType).
<K,V> PgxMap<K,V>	PgxSession.createMap(PropertyType keyType, PropertyType valueType) Blocking version of PgxSession.createMapAsync(PropertyType, PropertyType).
<K,V> PgxMap<K,V>	PgxGraph.createMap(PropertyType keyType, PropertyType valType, java.lang.String mapName) Blocking version of PgxGraph.createMapAsync(PropertyType, PropertyType, String).
<K,V> PgxMap<K,V>	PgxSession.createMap(PropertyType keyType, PropertyType valueType, java.lang.String name) Blocking version of PgxSession.createMapAsync(PropertyType, PropertyType, String).
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.inDegreeDistribution(PgxGraph graph) In-degree distribution gives information about the incoming flows in a graph
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.inDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) In-degree distribution gives information about the incoming flows in a graph
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.outDegreeDistribution(PgxGraph graph) Out-degree distribution gives information about the outgoing flows in a graph
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.outDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Out-degree distribution gives information about the outgoing flows in a graph
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer>	Analyst.randomWalkWithRestart(PgxGraph graph, ID source, int length, java.math.BigDecimal resetProb, PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) Convenience wrapper around Analyst.randomWalkWithRestart(PgxGraph, PgxVertex, int, double, PgxMap) taking a vertex ID instead of a PgxVertex.
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer>	Analyst.randomWalkWithRestart(PgxGraph graph, PgxVertex<ID> source, int length, double resetProb, PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) random walk with restart does the what its name says, it can find approximate stationary distributions

Methods in oracle.pgx.api that return types with arguments of type PgxMap

Modifier and Type	Method and Description
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>	Analyst.allReachableVerticesEdges(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>>	Analyst.allReachableVerticesEdgesAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>	Analyst.allReachableVerticesEdgesFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, EdgeFilter filter) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>>	Analyst.allReachableVerticesEdgesFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, EdgeFilter filter) Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>	Analyst.computeHighDegreeVertices(PgxGraph graph, int k) Computes the k vertices with the highest degrees in the graph.
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>	Analyst.computeHighDegreeVertices(PgxGraph graph, int k, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes the k vertices with the highest degrees in the graph.
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>>	Analyst.computeHighDegreeVerticesAsync(PgxGraph graph, int k) Computes the k vertices with the highest degrees in the graph.
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>>	Analyst.computeHighDegreeVerticesAsync(PgxGraph graph, int k, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes the k vertices with the highest degrees in the graph.
<K,V> PgxFuture<PgxMap<K,V>>	PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType) Creates a session-bound map
<K,V> PgxFuture<PgxMap<K,V>>	PgxSession.createMapAsync(PropertyType keyType, PropertyType valueType) Convenience method around PgxSession.createMapAsync(PropertyType, PropertyType, String) passing name as null.
<K,V> PgxFuture<PgxMap<K,V>>	PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType, java.lang.String mapName) Creates a session-bound map
<K,V> PgxFuture<PgxMap<K,V>>	PgxSession.createMapAsync(PropertyType keyType, PropertyType valueType, java.lang.String name) Creates a map.
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph) In-degree distribution gives information about the incoming flows in a graph
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) In-degree distribution gives information about the incoming flows in a graph
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph) Out-degree distribution gives information about the outgoing flows in a graph
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Out-degree distribution gives information about the outgoing flows in a graph
<ID> PgxFuture<PgxMap<PgxVertex<ID>,java.lang.Integer>>	Analyst.randomWalkWithRestartAsync(PgxGraph graph, PgxVertex<ID> source, int length, double resetProb, PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) random walk with restart does the what its name says, it can find approximate stationary distributions

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

Modifier and Type	Method and Description
<ID> Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>	Analyst.computeHighDegreeVertices(PgxGraph graph, int k, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes the k vertices with the highest degrees in the graph.
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>>	Analyst.computeHighDegreeVerticesAsync(PgxGraph graph, int k, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes the k vertices with the highest degrees in the graph.
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>>	Analyst.createDistanceIndex(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes an index with distances to each high-degree vertex.
<ID> VertexProperty<ID,PgxVect<java.lang.Integer>>	Analyst.createDistanceIndex(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes an index with distances to each high-degree vertex.
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>>	Analyst.createDistanceIndexAsync(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices) Computes an index with distances to each high-degree vertex.
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>>	Analyst.createDistanceIndexAsync(PgxGraph graph, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes an index with distances to each high-degree vertex.
<ID> org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>	Analyst.enumerateSimplePaths(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, VertexSet verticesOnPath, EdgeSet edgesOnPath, PgxMap<PgxVertex<ID>,java.lang.Integer> dist) Enumerate all simple paths between the source and destination vertex
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>>	Analyst.enumerateSimplePathsAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int k, VertexSet verticesOnPath, EdgeSet edgesOnPath, PgxMap<PgxVertex<ID>,java.lang.Integer> dist) Enumerate all simple paths between the source and destination vertex
<V extends java.lang.Comparable<V>> void	VertexSet.extractTopKFromMap(PgxMap<PgxVertex<ID>,V> map, int k) Blocking version of VertexSet.extractTopKFromMapAsync(PgxMap, int).
<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.
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.inDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) In-degree distribution gives information about the incoming flows in a graph
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.inDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) In-degree distribution gives information about the incoming flows in a graph
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDist(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter) Computes the k-hop limited shortest path between two vertices.
<ID> Pair<VertexSequence<ID>,EdgeSequence>	Analyst.limitedShortestPathHopDistFiltered(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter) Computes the k-hop limited shortest path between two vertices.
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>>	Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, int maxHops, PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping, VertexSet<ID> highDegreeVertices, VertexProperty<ID,PgxVect<java.lang.Integer>> index, EdgeFilter filter, VertexSequence<ID> pathVertices, EdgeSequence pathEdges) Computes the k-hop limited shortest path between two vertices.
PgxMap<java.lang.Integer,java.lang.Long>	Analyst.outDegreeDistribution(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Out-degree distribution gives information about the outgoing flows in a graph
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>>	Analyst.outDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) Out-degree distribution gives information about the outgoing flows in a graph
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer>	Analyst.randomWalkWithRestart(PgxGraph graph, ID source, int length, java.math.BigDecimal resetProb, PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) Convenience wrapper around Analyst.randomWalkWithRestart(PgxGraph, PgxVertex, int, double, PgxMap) taking a vertex ID instead of a PgxVertex.
<ID> PgxMap<PgxVertex<ID>,java.lang.Integer>	Analyst.randomWalkWithRestart(PgxGraph graph, PgxVertex<ID> source, int length, double resetProb, PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) random walk with restart does the what its name says, it can find approximate stationary distributions
<ID> PgxFuture<PgxMap<PgxVertex<ID>,java.lang.Integer>>	Analyst.randomWalkWithRestartAsync(PgxGraph graph, PgxVertex<ID> source, int length, double resetProb, PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount) random walk with restart does the what its name says, it can find approximate stationary distributions