This repository holds the various sample codes for my nerd_mmccoo youtube channel.

Computation and visualization of 3D minumum spanning trees from random points.

I have created several youtube tutorials with the examples in this repository which can be found in this playlist including an introduction found here

This directory contains the example data used in my paraview youtube tutorial

This directory contains the implementation of a basic computation of the delaunay triangulation. It reads vtk files (an import format of paraview) of points and writes a vtk of the resulting triangulation.

I have a youtube tutorial here

This directory contains an implementation of MST computation using the boost graph library. It reads vtk files of a graph (for example generated by the delaunay program above) and writes a vtk file of the MST

This directory combines the previous two programs into one. delaunay and mst

I have a youtube tutorial describing some of the confusing ascpects of the boost graph library.

This directory contains examples that are intended to clarify the property mapping aspects of the boost graph library. BGL documentation does contain some examples of how to get data in and out of the various algorithms, but the examples given in this repo are intended to supplement that.

There are several ways that graph properties can be connected to a graph. While most of these are pretty simple, it can be hard to know that from reading the docs. Hopefully, these examples will show how easy it is.