Graph Convolutional Branch and Bound v1.0.0
A TSP solver that combines a graph convolutional network with a 1-Tree branch-and-bound.
Loading...
Searching...
No Matches
prim.h
Go to the documentation of this file.
1
14#ifndef BRANCHANDBOUND1TREE_PRIM_H
15#define BRANCHANDBOUND1TREE_PRIM_H
16#include "../data_structures/mst.h"
17
18
20
26void prim(const Graph * graph, MST * mst);
27
28#endif //BRANCHANDBOUND1TREE_PRIM_H
prim
void prim(const Graph *graph, MST *mst)
The Prim algorithm to find the Minimum Spanning Tree O(|E| + |V| log |V|)
Definition: prim.c:16
Graph
Structure of a Graph.
Definition: graph.h:51
MST
Minimum Spanning Tree, or MST, and also a 1-Tree.
Definition: mst.h:28
Generated by doxygen 1.9.6