R

R copied to clipboard

Random walk restart

1

Algorithm: Random Walk with Restart (RWR) Purpose: Computes relevance scores of nodes in a graph based on a random walker that restarts at a source node with a fixed probability....

ArpitaHanjagi

Vf2 graph isomorphism

1

Determines whether two graphs are isomorphic (structurally identical). Uses the VF2 algorithm, which is a backtracking approach with feasibility checks. Checks both node compatibility and edge compatibility for already-mapped nodes....

ArpitaHanjagi

Feat graph colouring

4

• Assigns colors to graph vertices ensuring no adjacent vertices share the same color • Uses backtracking approach for optimal solution • Finds chromatic number (minimum colors needed) • Implements...

Prathameshk2024

Add edmonds blossom algo

1

Overview This implementation defines Edmonds’ Blossom Algorithm in R for computing the maximum matching in general (non-bipartite) graphs. The algorithm finds the largest set of edges without shared vertices, handling...

AtharvaPatange

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...

nachiket2005

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...

nachiket2005

Feat-CNN

1

Overview This implementation defines a Convolutional Neural Network (CNN) in R using the Keras library. The CNN is designed to automatically extract spatial and hierarchical features from image data for...

AtharvaPatange

Add store wanger

1

Overview This implementation defines the Stoer-Wagner algorithm in R for computing the global minimum cut of an undirected weighted graph. The algorithm identifies the smallest set of edges whose removal...

AtharvaPatange

Add Sleep Sort Algorithm in R

2

This PR introduces **Sleep Sort**, a playful and educational sorting algorithm implemented in R. Sleep Sort launches one task per element, sleeps for a duration proportional to the element's value,...

Siddhram

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...

nachiket2005