Program Structure The Selection Sort algorithm sorts an array by repeatedly finding the minimum element from the unsorted part and moving it to […]
Author: Aditya Bhuyan
Java
Bubble Sort Algorithm in Java
Overview Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are […]
C
Graph Coloring Program in C
Overview This program implements a greedy algorithm to color a graph using the minimum number of colors. The goal is to ensure that […]
C
Word Ladder Problem: BFS Implementation in C
The Word Ladder Problem involves transforming a starting word into an ending word by changing one letter at a time. Each intermediate word […]
C
Kruskal’s Algorithm for Minimum Spanning Tree in C
Program Overview This C program implements Kruskal’s algorithm to find the Minimum Spanning Tree (MST) of a given connected, undirected graph. The program […]
C
Dijkstra’s Algorithm Implementation in C
Program Explanation This program implements Dijkstra’s Algorithm to find the shortest path from a source vertex to all other vertices in a weighted […]
C
Topological Sorting in C
Topological sorting is a linear ordering of vertices in a directed acyclic graph (DAG) such that for every directed edge u → v, […]
C
Cycle Detection in a Graph in C
Program Overview This C program detects whether a cycle exists in a directed graph using Depth First Search (DFS). It utilizes a recursive […]
C
Breadth-First Search (BFS) in C
Program Explanation The Breadth-First Search (BFS) algorithm is a traversing algorithm for graphs or trees. It explores the neighbor nodes at the present […]
C
Depth First Search (DFS) Traversal in C
Program Structure The program consists of several key components: Graph Representation: The graph is represented using an adjacency list. This is efficient for […]
