Package | Description |
---|---|
oracle.pgx.api |
This package contains the Java APIs of PGX.
|
Modifier and Type | Method and Description |
---|---|
<ID extends Comparable<ID>> |
Analyst.communitiesLabelPropagation(PgxGraph graph)
Blocking version of
#communitiesLabelPropagationAsync() . |
<ID extends Comparable<ID>> |
PgxGraph.createComponents(VertexProperty<ID,Integer> components, int numComponents)
Blocking version of
#createComponentsAsync() . |
<ID extends Comparable<ID>> |
Analyst.sccKosaraju(PgxGraph graph)
Blocking version of
#sccKosarajuAsync() . |
<ID extends Comparable<ID>> |
Analyst.sccTarjan(PgxGraph graph)
Blocking version of
#sccTarjanAsync() . |
<ID extends Comparable<ID>> |
Analyst.wcc(PgxGraph graph)
Blocking version of
#wccAsync() . |
Modifier and Type | Method and Description |
---|---|
<ID extends Comparable<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph)
Detect communities using parallel label propagation.
|
<ID extends Comparable<ID>> |
PgxGraph.createComponentsAsync(VertexProperty<ID,Integer> components, int numComponents)
Creates a
Partition object holding a collection of vertex sets, each representing a component. |
<ID extends Comparable<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph)
Find strongly connected components using Kosaraju's algorithm.
|
<ID extends Comparable<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph)
Find strongly connected components using Tarjan's algorithm.
|
<ID extends Comparable<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
|
Modifier and Type | Method and Description |
---|---|
<ID extends Comparable<ID>> |
Analyst.partitionConductance(PgxGraph graph, Partition<ID> components)
Blocking version of
#partitionConductanceAsync() . |
<ID extends Comparable<ID>> |
Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)
Compute the conductance of a partition.
|
<ID extends Comparable<ID>> |
Analyst.partitionModularity(PgxGraph graph, Partition<ID> components)
Blocking version of
#partitionModularityAsync() . |
<ID extends Comparable<ID>> |
Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition)
Compute the modularity of a partition.
|
Copyright © 2015. All rights reserved.