Uses of Class
oracle.pgx.api.Partition

Packages that use Partition

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

Uses of Partition in oracle.pgx.api

Methods in oracle.pgx.api that return Partition

Modifier and Type	Method and Description
<ID> Partition<ID>	Analyst.communitiesConductanceMinimization(PgxGraph graph, int max) Blocking version of Analyst.communitiesConductanceMinimizationAsync(PgxGraph, int).
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph) Blocking version of Analyst.communitiesLabelPropagationAsync(PgxGraph).
<ID> Partition<ID>	Analyst.communitiesLabelPropagation(PgxGraph graph, int maxIterations) Blocking version of Analyst.communitiesLabelPropagationAsync(PgxGraph, int).
<ID> Partition<ID>	PgxGraph.createComponents(VertexProperty<ID,java.lang.Long> components, long numComponents) Blocking version of PgxGraph.createComponentsAsync(VertexProperty, long).
<ID> Partition<ID>	Analyst.sccKosaraju(PgxGraph graph) Blocking version of Analyst.sccKosarajuAsync(PgxGraph).
<ID> Partition<ID>	Analyst.sccTarjan(PgxGraph graph) Blocking version of Analyst.sccTarjanAsync(PgxGraph).
<ID> Partition<ID>	Analyst.wcc(PgxGraph graph) Blocking version of Analyst.wccAsync(PgxGraph).

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

Modifier and Type	Method and Description
<ID> PgxFuture<Partition<ID>>	Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max) 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>>	PgxGraph.createComponentsAsync(VertexProperty<ID,java.lang.Long> components, long numComponents) Creates a Partition object holding a collection of vertex sets, each representing a component.
<ID> PgxFuture<Partition<ID>>	Analyst.sccKosarajuAsync(PgxGraph graph) 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.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

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

Modifier and Type	Method and Description
<ID> Scalar<java.lang.Double>	Analyst.conductance(PgxGraph graph, Partition<ID> partition, long partitionIndex) Blocking version of Analyst.conductanceAsync(PgxGraph, Partition, long).
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex) Compute the conductance of a single vertex partition.
<ID> Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>	Analyst.partitionConductance(PgxGraph graph, Partition<ID> components) Blocking version of Analyst.partitionModularityAsync(PgxGraph, Partition).
<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> Scalar<java.lang.Double>	Analyst.partitionModularity(PgxGraph graph, Partition<ID> components) Blocking version of Analyst.partitionConductanceAsync(PgxGraph, Partition).
<ID> PgxFuture<Scalar<java.lang.Double>>	Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition) Compute the modularity of a partition.