Zog.MST (Zog v0.1.0)

Native Minimum Spanning Tree (MST) algorithms backed by Zog (Zig) via Zigler.

Summary

Functions

Computes the Minimum Spanning Tree (MST) of an undirected graph natively using Kruskal's algorithm.

Functions

kruskal(builder)

@spec kruskal(Zog.SoA.t()) :: {:ok, [Yog.MST.edge()]}

Computes the Minimum Spanning Tree (MST) of an undirected graph natively using Kruskal's algorithm.

nif_kruskal(arg1, arg2, arg3, arg4)

@spec nif_kruskal(
  0..18_446_744_073_709_551_615,
  [0..4_294_967_295] | <<_::_*32>>,
  [0..4_294_967_295] | <<_::_*32>>,
  [float()] | <<_::_*64>>
) :: term()