projects/GraphConvolutionalBranchandBound/kruskal_8h_source.html

#ifndef BRANCHANDBOUND1TREE_KRUSKAL_H

#define BRANCHANDBOUND1TREE_KRUSKAL_H

#include "../data_structures/mst.h"


static void swap(Graph * graph, unsigned short swap_1, unsigned short swap_2);


static int pivot_quicksort(Graph * graph, unsigned short first, unsigned short last);


static void quick_sort(Graph * graph, unsigned short first, unsigned short last);


void wrap_quick_sort(Graph * graph);


void kruskal(Graph * graph, MST * mst);


#endif //BRANCHANDBOUND1TREE_KRUSKAL_H

swap
static void swap(Graph *graph, unsigned short swap_1, unsigned short swap_2)
Swaps two edges in the list of edges in the Graph.

kruskal
void kruskal(Graph *graph, MST *mst)
The Kruskal algorithm to find the Minimum Spanning Tree O(|E| log |V|)
Definition: kruskal.c:131

pivot_quicksort
static int pivot_quicksort(Graph *graph, unsigned short first, unsigned short last)
The core of the quick sort algorithm.

wrap_quick_sort
void wrap_quick_sort(Graph *graph)
The wrapper of the quick sort algorithm.
Definition: kruskal.c:123

quick_sort
static void quick_sort(Graph *graph, unsigned short first, unsigned short last)
The quick sort algorithm O(n log n).

Graph
Structure of a Graph.
Definition: graph.h:51

MST
Minimum Spanning Tree, or MST, and also a 1-Tree.
Definition: mst.h:28