Examples:


Prim minimum spanning tree:

cbnn -T -O ../datasets/s2.ts s2_random.cb s2_random_out.cb graph_out.dgr

Nearest neighbours graph:

cbnn -N -S256 -X3 -K3 -O ../datasets/s2.ts s2_random.cb s2_random_out.cb\ 
graph_out.dgr

Here the 3 after -K option tells the number of neighbours.

Voronoi-neighbours graph:

cbnn -V -O s2.ts s2_random.cb s2_vor.cb s2_random_voronoi.dgr

Fast kNN:

cbnn -A1 -O ../datasets/s2.ts s2_random_256.cb s2_random_out.cb graph_out.dgr
