| Modifier and Type | Method and Description |
|---|---|
static int |
JNvgraph.nvgraphAllocateEdgeData(nvgraphHandle handle,
nvgraphGraphDescr descrG,
long numsets,
Pointer settypes)
Allocate numsets vectors of size E reprensenting Edge Data and attached them the graph.
|
static int |
JNvgraph.nvgraphAllocateVertexData(nvgraphHandle handle,
nvgraphGraphDescr descrG,
long numsets,
Pointer settypes)
Allocate numsets vectors of size V reprensenting Vertex Data and attached them the graph.
|
static int |
JNvgraph.nvgraphAnalyzeClustering(nvgraphHandle handle,
nvgraphGraphDescr graph_descr,
long weight_index,
int n_clusters,
Pointer clustering,
int metric,
Pointer score)
nvGRAPH analyze clustering
Given a graph, a clustering, and a metric
compute the score that measures the clustering quality according to the metric.
|
static int |
JNvgraph.nvgraphContractGraph(nvgraphHandle handle,
nvgraphGraphDescr descrG,
nvgraphGraphDescr contrdescrG,
Pointer aggregates,
long numaggregates,
int VertexCombineOp,
int VertexReduceOp,
int EdgeCombineOp,
int EdgeReduceOp,
int flag)
nvGRAPH contraction
given array of agregates contract graph with
given (Combine, Reduce) operators for Vertex Set
and Edge Set;
|
static int |
JNvgraph.nvgraphConvertGraph(nvgraphHandle handle,
nvgraphGraphDescr srcDescrG,
nvgraphGraphDescr dstDescrG,
int dstTType)
Convert graph to another structure
|
static int |
JNvgraph.nvgraphConvertTopology(nvgraphHandle handle,
int srcTType,
Object srcTopology,
Pointer srcEdgeData,
Pointer dataType,
int dstTType,
Object dstTopology,
Pointer dstEdgeData)
Convert the edge data to another topology
|
static int |
JNvgraph.nvgraphCreate(nvgraphHandle handle)
Open the library and create the handle
|
static int |
JNvgraph.nvgraphCreateGraphDescr(nvgraphHandle handle,
nvgraphGraphDescr descrG)
Create an empty graph descriptor
|
static int |
JNvgraph.nvgraphDestroy(nvgraphHandle handle)
Close the library and destroy the handle
|
static int |
JNvgraph.nvgraphDestroyGraphDescr(nvgraphHandle handle,
nvgraphGraphDescr descrG)
Destroy a graph descriptor
|
static int |
JNvgraph.nvgraphExtractSubgraphByEdge(nvgraphHandle handle,
nvgraphGraphDescr descrG,
nvgraphGraphDescr subdescrG,
Pointer subedges,
long numedges)
create a new graph by extracting a subgraph given a list of edges
|
static int |
JNvgraph.nvgraphExtractSubgraphByVertex(nvgraphHandle handle,
nvgraphGraphDescr descrG,
nvgraphGraphDescr subdescrG,
Pointer subvertices,
long numvertices)
create a new graph by extracting a subgraph given a list of vertices
|
static int |
JNvgraph.nvgraphGetEdgeData(nvgraphHandle handle,
nvgraphGraphDescr descrG,
Pointer edgeData,
long setnum)
Copy the edge set #setnum in *edgeData, sets have 0-based index
|
static int |
JNvgraph.nvgraphGetGraphStructure(nvgraphHandle handle,
nvgraphGraphDescr descrG,
Object topologyData,
int[] TType)
Query size and topology information from the graph descriptor
|
static int |
JNvgraph.nvgraphGetVertexData(nvgraphHandle handle,
nvgraphGraphDescr descrG,
Pointer vertexData,
long setnum)
Copy the edge set #setnum in *edgeData, sets have 0-based index
Conversions are not sopported so nvgraphTopologyType_t should match the graph structure
|
static int |
JNvgraph.nvgraphPagerank(nvgraphHandle handle,
nvgraphGraphDescr descrG,
long weight_index,
Pointer alpha,
long bookmark_index,
int has_guess,
long pagerank_index,
float tolerance,
int max_iter)
nvGRAPH PageRank
Find PageRank for each vertex of a graph with a given transition probabilities, a bookmark vector of dangling vertices, and the damping factor.
|
static int |
JNvgraph.nvgraphSetEdgeData(nvgraphHandle handle,
nvgraphGraphDescr descrG,
Pointer edgeData,
long setnum)
Update the edge set #setnum with the data in *edgeData, sets have 0-based index
|
static int |
JNvgraph.nvgraphSetGraphStructure(nvgraphHandle handle,
nvgraphGraphDescr descrG,
Object topologyData,
int TType)
Set size, topology data in the graph descriptor
|
static int |
JNvgraph.nvgraphSetVertexData(nvgraphHandle handle,
nvgraphGraphDescr descrG,
Pointer vertexData,
long setnum)
Update the vertex set #setnum with the data in *vertexData, sets have 0-based index
Conversions are not sopported so nvgraphTopologyType_t should match the graph structure
|
static int |
JNvgraph.nvgraphSpectralClustering(nvgraphHandle handle,
nvgraphGraphDescr graph_descr,
long weight_index,
SpectralClusteringParameter params,
Pointer clustering,
Pointer eig_vals,
Pointer eig_vects)
nvGRAPH spectral clustering
given a graph and solver parameters of struct SpectralClusteringParameter,
assign vertices to groups such as
intra-group connections are strong and/or inter-groups connections are weak
using spectral technique.
|
static int |
JNvgraph.nvgraphSrSpmv(nvgraphHandle handle,
nvgraphGraphDescr descrG,
long weight_index,
Pointer alpha,
long x_index,
Pointer beta,
long y_index,
int SR)
nvGRAPH Semi-ring sparse matrix vector multiplication
|
static int |
JNvgraph.nvgraphSssp(nvgraphHandle handle,
nvgraphGraphDescr descrG,
long weight_index,
Pointer source_vert,
long sssp_index)
nvGRAPH Single Source Shortest Path (SSSP)
Calculate the shortest path distance from a single vertex in the graph to all other vertices.
|
static int |
JNvgraph.nvgraphTraversal(nvgraphHandle handle,
nvgraphGraphDescr descrG,
int traversalT,
Pointer source_vert,
nvgraphTraversalParameter params) |
static int |
JNvgraph.nvgraphTriangleCount(nvgraphHandle handle,
nvgraphGraphDescr graph_descr,
long[] result)
nvGRAPH Triangles counting
count number of triangles (cycles of size 3) formed by graph edges
|
static int |
JNvgraph.nvgraphWidestPath(nvgraphHandle handle,
nvgraphGraphDescr descrG,
long weight_index,
Pointer source_vert,
long widest_path_index)
nvGRAPH WidestPath
Find widest path potential from source_index to every other vertices.
|
Copyright © 2020. All rights reserved.