glauber_dynamics_c/vertex_8h_source.html

#include "edge.h"


typedef struct vertex {

                int dim;

                double local_weight;

                edge **edges;

} vertex;;


vertex *vertex_new();


void vertex_free(vertex *v);


void vertex_add_edge_to_neighbourhood(vertex *v, edge *e);


void vertex_rm_edge_from_neighbourhood(vertex *v, edge *e);


edge *vertex_find_connecting_edge(vertex *v, int dst);

edge.h
Define the edge struct and functions relating to it.

edge
Edge struct to be used as edges in the graph structs.
Definition: edge.h:10

vertex
The vertex struct containing the neighbouring edges as pointers.
Definition: vertex.h:16

vertex::edges
edge ** edges
The list of neighbour edge instances as pointers.
Definition: vertex.h:19

vertex::local_weight
double local_weight
The sum of all weights of connected edges.
Definition: vertex.h:18

vertex::dim
int dim
The number of slots in array (local dimension)
Definition: vertex.h:17

vertex_add_edge_to_neighbourhood
void vertex_add_edge_to_neighbourhood(vertex *v, edge *e)
Add the edge e to the neighbourhood v->edges.
Definition: vertex.c:23

vertex_find_connecting_edge
edge * vertex_find_connecting_edge(vertex *v, int dst)
Find the edge that connects vertex v with the vertex of index dst.
Definition: vertex.c:77

vertex_new
vertex * vertex_new()
Allocate the memory for a new vertex with no neighbours.
Definition: vertex.c:6

vertex_rm_edge_from_neighbourhood
void vertex_rm_edge_from_neighbourhood(vertex *v, edge *e)
Remove edge e from neighbourhood of vertex v.
Definition: vertex.c:65

vertex_free
void vertex_free(vertex *v)
Free the input vertex pointer and all edges pointing to it.
Definition: vertex.c:13

vertex
struct vertex vertex
The typedef of the vertex struct.