glauber_dynamics_c/weightedgraph_8h_source.html

#include <stdio.h>

#include "vertex.h"


typedef struct graph {

        int n;

        int m;

        vertex **vertices;

        edge **edges;

} graph;


graph *graph_new();


void graph_free(graph *g);


void graph_add_n_vertices(graph *g, int n);


void graph_add_edge(graph *g, int v1, int v2, int weight);


void graph_rm_edge(graph *g, int v1, int v2);


graph *graph_construct_torus(int n, int d, int init_weight);


void draw_torus2png(graph *draw_torus, int n, int d, unsigned int duration,

                    FILE *out_stream, int max_width, int max_height, int max_dpi,

                    int penwidth, double passed_time);

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

graph
The graph struct containing the pointers to edges and vertices.
Definition: weightedgraph.h:15

graph::vertices
vertex ** vertices
List of vertex pointers for vertices contained in the graph.
Definition: weightedgraph.h:18

graph::m
int m
The number of edges in the graph.
Definition: weightedgraph.h:17

graph::edges
edge ** edges
List of edge pointers for vertices contained in the graph.
Definition: weightedgraph.h:19

graph::n
int n
The number of vertices in the graph.
Definition: weightedgraph.h:16

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

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

graph_rm_edge
void graph_rm_edge(graph *g, int v1, int v2)
Searches for an edge connecting v1 and v2 and removes it.
Definition: weightedgraph.c:82

graph_add_edge
void graph_add_edge(graph *g, int v1, int v2, int weight)
Connect vertices with index v1 and v2 with an edge of weight weight.
Definition: weightedgraph.c:59

graph
struct graph graph
The typedef of the graph struct.

draw_torus2png
void draw_torus2png(graph *draw_torus, int n, int d, unsigned int duration, FILE *out_stream, int max_width, int max_height, int max_dpi, int penwidth, double passed_time)
Output a png rendering of draw_torus to out_stream.
Definition: weightedgraph.c:158

graph_free
void graph_free(graph *g)
Free all the memory contained in the graph.
Definition: weightedgraph.c:24

graph_construct_torus
graph * graph_construct_torus(int n, int d, int init_weight)
Allocate memory for a square lattice with periodic boundary conditions (i.e. a torus).
Definition: weightedgraph.c:116

graph_new
graph * graph_new()
Allocate memory for an empty graph.
Definition: weightedgraph.c:18

graph_add_n_vertices
void graph_add_n_vertices(graph *g, int n)
Add n newly created empty vertices to the graph.
Definition: weightedgraph.c:50