COMBINATORIAL_BLAS 1.6
Loading...
Searching...
No Matches
dist_graph.h File Reference
#include <stdint.h>
#include "fast_map.h"
Include dependency graph for dist_graph.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  dist_graph_t
struct  graph_gen_data_t

Macros

#define out_degree(g, n)
#define in_degree(g, n)
#define out_vertices(g, n)
#define in_vertices(g, n)

Functions

int create_graph (graph_gen_data_t *ggi, dist_graph_t *g)
int create_graph_serial (graph_gen_data_t *ggi, dist_graph_t *g)
int clear_graph (dist_graph_t *g)
int relabel_edges (dist_graph_t *g)
int relabel_edges (dist_graph_t *g, int32_t *global_parts)
int repart_graph (dist_graph_t *g, mpi_data_t *comm, char *part_file)
int repart_graph (dist_graph_t *g, mpi_data_t *comm, int32_t *local_parts)
int get_max_degree_vert (dist_graph_t *g)

Macro Definition Documentation

◆ in_degree

#define in_degree ( g,
n )
Value:
(g->in_degree_list[n+1] - g->in_degree_list[n])

Definition at line 55 of file dist_graph.h.

◆ in_vertices

#define in_vertices ( g,
n )
Value:
&g->in_edges[g->in_degree_list[n]]

Definition at line 57 of file dist_graph.h.

◆ out_degree

#define out_degree ( g,
n )
Value:
(g->out_degree_list[n+1] - g->out_degree_list[n])

Definition at line 54 of file dist_graph.h.

◆ out_vertices

#define out_vertices ( g,
n )
Value:
&g->out_edges[g->out_degree_list[n]]

Definition at line 56 of file dist_graph.h.

Function Documentation

◆ clear_graph()

int clear_graph ( dist_graph_t * g)

Definition at line 251 of file dist_graph.cpp.

◆ create_graph()

int create_graph ( graph_gen_data_t * ggi,
dist_graph_t * g )

Definition at line 62 of file dist_graph.cpp.

◆ create_graph_serial()

int create_graph_serial ( graph_gen_data_t * ggi,
dist_graph_t * g )

Definition at line 155 of file dist_graph.cpp.

◆ get_max_degree_vert()

int get_max_degree_vert ( dist_graph_t * g)

Definition at line 846 of file dist_graph.cpp.

◆ relabel_edges() [1/2]

int relabel_edges ( dist_graph_t * g)

Definition at line 271 of file dist_graph.cpp.

◆ relabel_edges() [2/2]

int relabel_edges ( dist_graph_t * g,
int32_t * global_parts )

Definition at line 351 of file dist_graph.cpp.

◆ repart_graph() [1/2]

int repart_graph ( dist_graph_t * g,
mpi_data_t * comm,
char * part_file )

Definition at line 430 of file dist_graph.cpp.

◆ repart_graph() [2/2]

int repart_graph ( dist_graph_t * g,
mpi_data_t * comm,
int32_t * local_parts )

Definition at line 492 of file dist_graph.cpp.