Nachiket Payannavar

Add Boruvka's MST in R

1

## Overview The `boruvka_mst` function constructs a **minimum spanning tree (MST)** for an undirected weighted graph. It repeatedly adds the **cheapest edge for each component**, merging connected components until all...

Add Edmonds-Karp Algorithm in R

1

## Overview The `edmonds_karp` function finds the maximum flow in a directed network by repeatedly searching for **augmenting paths** using **Breadth-First Search (BFS)**. At each iteration, it augments the flow...

Add Fast Fourier Transform (FFT) in R

1

## Overview The `fft_recursive` function decomposes a DFT of size *N* into smaller DFTs of even and odd indexed elements, recursively combining their results. If the input vector’s length is...

Add Hamiltonian Path in R

1

## Overview The `hamiltonianPath` function attempts to construct a valid Hamiltonian Path by recursively adding vertices to a path while ensuring adjacency and non-repetition constraints. If the input adjacency matrix...