C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C Prime Number code in C Factorial Program in C using For Loop Factorial Program in C Using While Loop Fibonacci Series in C Using For Loop Fibonacci series in C using while loop Prime Number Program in C using for Loop While Loop in C programming examples Built-in functions in C Assert() Function C vs Java Strings Call Back Function in Embedded C Else If Ladder fgets() function Ftell() Function getc() function getch() function gets() function Heap Sort Nested if-else statement Pi() Function Positioning of file Write() function abs() function in C Attributes in C C program to find factorial of a number using Recursion Ferror() in c fopen() function in C Fibonacci series program in C using Recursion Formatted Input and output function in C Snake Game in C User Defined Functions in C Beep() function in C Cbrt() function in C Hook() function in C Isalnum() function in C C Program to find the Roots of a Quadratic Equation C Switch Statements Difference between rand() and srand() function in C Difference between while and for loop in C Doubly Linked list in C Example of Iteration in C How to use atoi() function in C How to use floor() function in C How to use sine() function in C How to use Typedef Struct in C Integer Promotions in C C Program Swap Numbers in cyclic order Using Call by Reference C Program to Find Largest Number Using Dynamic Memory Allocation C Program to Find the Largest Number using Ternary Operator C/C++ Program to Find the Size of int, float, double and char Find the Largest Three Distinct Elements in an Array using C/C++ Loop Questions in C Modulus on Negative Numbers in C Multiplication table program in C using For loop Nested Loops in C Programming Examples C Program for Mean and Median of an Unsorted Array Results of Comparison Operations in C and C++ Reverse a Stack using Recursion in C Simple hash() function in C strcat() Function in C Sum of N numbers in C using For loop Use of free() function in C Write a program that produces different results in C and C++ C Function Argument and Return Values Keywords in C Bank management system in C Calendar application in C Floor() Function in C Free() Function in C How to delete a file in C How to move a text in C Remove an element from an array in C Unformatted input() and output() function in C What are linker and loader in C SJF Scheduling Program in C Socket Programming in C Structure in C Tower of Hanoi in C Union Program in C Variable Declaration in C What is Linked List in C While Loop Syntax in C fork() in C GCD program in C Branching Statements in C Comma Operator in C Control statement in C Double Specifier in C How to create a binary file in C Long int in C Palindrome Number in C Pure Virtual Function in C Run Time Polymorphism in C Types of Array in C Types of Function in C What is a buffer in C What is required in each C Program Associativity of Operators in C Bit Stuffing Program in C Actual and Formal Parameters Addition of two Numbers in C Advantages of function in C Arithmetic Progression Program in C Binomial Coefficient Program in C Difference between Array and List in C Diffie-Hellman Algorithm in C How to convert a number to words in C How to convert a string to hexadecimal in C Difference between If and Switch Statement in C C and C++ Binary Files C program that does not Suspend when Ctrl+Z is Pressed Different ways to Declare the Variable as Constant in C Range of Int in C C Program to find the size of a File FIFO Example in the C Language For loop in C Programming GCD program of two numbers in C GPA Calculator in C How to Calculate Time Complexity in C How to include graphics.h in C How to measure time taken by a function in C How to return a Pointer from a Function in C What is the main in C Addition of Matrix in C Booleans in C C Program for Extended Euclidean algorithms C Program of Fencing the Ground Ceil and Floor in C Compound Interest Program in C Displaying Array in C Distance Vector Routing Protocol Program in c Dos.h Header File in C Language DSA Program in C Explain the two-way selection in C Fee Management System in C File Operations in C Malloc function in C Multiplication Table in C Simple Programs in C Language tolower() Function in C Type Conversion in the C Why does sizeof(x++) not Increment x in C Advantages of Dynamic Memory Allocation in C Armstrong Number in C Assignment Operator Program in C Banker’s Algorithm in C Binary Search in C with Best and Worst Time Complexity Caesar Cipher Program in C Call by Value and Call by Reference in C Conditional Operator in C CRC Program in C Deadlock Detection Program in C Decimal to Binary in C Difference between If Else and Nested If Else in C Difference between Pre-increment and Post-increment in C Difference between Scope and Lifetime in C Evaluation of Arithmetic Expression in C Explain the Increment and Decrement Operators in C Fseek Function in C Functions in C How to Find Square Free Numbers in C Length of an Array Function in C OpenGL in C Projects on C language in 2023 Purpose of a Function Prototype in C Stdio.h in C Two-Dimensional array in C What is String Comparison in C C Compilers for Windows Functions and Recursion in C How to Declare Boolean in C How to Declare Character in C How to Round up a number in C How to use strlen() in C Pointer Declaration in C Algorithm for String Palindrome in C C Program to find ASCII value of a character Constant Pointer in C How to find string length in C using strlen() function Implicit and Explicit in C Indirect Recursion in C Input and Output functions in C isupper() in C Jump Statement in C Lifetime of a Variable in C Linker Error in C Language Numeric Constant in C Size of Pointer in C Square Root in C Language Static and Dynamic Memory allocation String Declaration in C Strong Number in C Symmetric Matrix in C Types of C Tokens What is a Size of Pointer in C What is Increment and Decrement Operator in C 1 2 3 4 Series Program in C Advantages and Disadvantages of C Language C Program for Polynomial Addition C Program to Count the Number of Vowels in a String C Programming Errors and Solutions Compilation Errors in C Complex C Programs Difference between Argument and Parameter in C Difference between char s[] and char *s in C Evaluation of Postfix Expression Using Stack in C Find Leftmost and Rightmost Set Bit of a Number fprintf and fscanf in C Introduction to Dynamic Array in C Print Address in C Realloc function in C Ternary Operators in C Types of Tokens in C with Examples Difference between Static and Dynamic Memory Allocation in C Addition Program in C Array Definition in C Array of Pointers in C Arrow Operator in C Average of Two Numbers in C Binary to Decimal in C Binary to Octal in C BREAK STATEMENT in C C Programming Operators Questions C Programs Asked in Interview Calculator Program in C C Program to Read and Print an Employee's Detail Using Structure Bubble Sort Algorithm in C C Program to Find Area and Perimeter of Circle C Program to Check Whether a Given Number is Even or Odd C in Roman Numerals C Program to Make a Simple Calculator Using Switch Case Insertion Sort Program in C How to take input in string in C GCC Conflicting Types in C Function Definition in C Format Specifier for Hexadecimal in C Flowchart in C Float in C Fizzbuzz Implementation in C Conditional Statement in C Conio.h functions list in C Constants in C Dynamic Array in C Decision Making Statements in C Continue Statement in C Creation of Thread in C DFS Algorithm in C Difference between parameter and arguments in C Dijkstra's Algorithm in C Leap Year Program in C Jump Statements in C Modulus Operator in C Memory Allocation in C Simple Interest Program in C Reverse Array in C Recursive Function in C Queue in C Printing Pascal’s Triangle in C Preprocessor Directives in C Perror() in C Perfect Number in C Programming Language Parameter Passing Techniques in C Pascal Triangle in C Patterm Program in C Diagonal Matrix in C Converting Dollars into Rupees in C Typedef Function Pointer in C Unsigned Char in C C Program to Calculate Percentage C Program to Find Sum of Array Elements Clock Program in C How to reverse a number in C? Insert Array in C Kbhit() Function in C Can We Learn Python Without C? C program to convert decimal to hexadecimal C program to draw a circle C Program to Calculate Electricity Bill C program for string concatenation C program to convert decimal to binary without using array Graphics Programming in C File Handling Functions in C Convert Char to Int in C Identifiers In C ftok() function in C Dangling else program in C DFS Program in C Ifdef in C How to initialise an array in c Implementation of queue using Array in C Selection Statements in C Size of Char in C Strchr() function in C Symbolic Constants in C Tree Data Structure in C Type Conversion in C Types of Constants in C Void data type in C Argument in C Bitwise Operator in C Circular queue in C COMPILER IN C ctype h in c execvp() function in C Exit function in C Hashing in C How to define a global variable in C

DFS Algorithm in C

Introduction DFS Algorithm

DFS, short for Depth First Search, is a graph traversal algorithm used to search all the vertices of a graph in a systematic and structured way. It works recursively by visiting points in the graph and going as far as possible on each branch before returning. The DFS algorithm starts by visiting an arbitrary vertex in the graph, marks it as visited, and then recursively examines all its unvisited neighbors. This process continues until all vertices of the graph have been visited. DFS can be implemented with either recursion or an explicit stack. When using recursion, the algorithm calls itself recursively for each unvisited neighbor of the current vertex. When using an explicit stack, the algorithm pushes each unvisited neighbor onto the stack and jumps from the top of the stack to the next visited vertex. DFS is commonly used for various graph-related problems, such as detecting cycles in a graph, finding connected components, and traversing trees. It can also solve other problems, such as generating permutations, combinations, and subsets. One important thing to note is that DFS may not visit all the vertices of a graph when the graph is disconnected. The algorithm must be run separately for each connected component in such cases. Additionally, DFS can be used to find a path from one vertex of a graph to another, but it may need to find the shortest path between them.

DFS Algorithm in C

History of the DFS Algorithm

The DFS algorithm has a long and exciting history dating back to the early days of graph theory and computer science. The first recorded use of DFS comes from the work of French mathematician Charles Pierre Trémaux in the 19th century. Trémaux used a variation of DFS to solve the famous "maze problem," which involved finding a path through a maze without dead ends. In the early 20th century, the DFS algorithm was further improved and formalized by several prominent mathematicians and computer scientists, including Edsger Dijkstra, John Hopcroft, and Robert Tarjan. Dijkstra's algorithm, a variant of DFS, is widely used today to find the shortest path in a graph. DFS became even more popular with the rise of computing in the mid-20th century. It was widely used in developing early programming languages and operating systems and helped develop many classic algorithms, including binary search and topological sorting. Today, DFS is a fundamental algorithm in computer science and is used in many applications, including network analysis, social network analysis, and natural language processing. Its simplicity, efficiency, and flexibility make it a powerful tool for exploring and analyzing complex data structures.

How DFS Algorithm works?

Depth First Search, works in depth first when traversing a graph, meaning it searches as far as possible on each branch before returning. The DFS algorithm typically works as follows:

1. To begin, select any vertex as the starting point in the graph.

2. Mark the starting point as visited and add it to the stack or queue to track the current path.

3. Visit each unvisited neighbor of the current vertex in turn. For each neighbor, mark it as visited, add it to the stack or queue, and recursively visit its unvisited neighbors.

4. If the vertex has no neighbors, return to the previous vertex of the stack or queue and continue visiting its neighbors.

5. Repeat this until all vertices of the graph have been visited. A simple example can illustrate the process.

Consider the following undirected graph:

DFS Algorithm in C

Suppose we start at a. The DFS algorithm works as follows:

  1. Visit vertex a, mark it as visited, and add it to the stack or queue.
  2. Visit the unvisited neighbor b, mark it as visited, and add it to the stack or queue.
  3. Visit an unvisited neighbor d, mark it as visited, and add it to the stack or queue.
  4. Since d has no neighbors, return to b.
  5. Visit an unvisited neighbor c, mark it as visited, and add it to the stack or queue.
  6. Since c has no neighbors, return to a.
  7. Since a has no neighbors, the algorithm terminates. This example results in the path a -> b -> d -> c.

This is one of many possible paths; DFS can visit the points in any order. DFS can be implemented using either recursion or an explicit stack or queue. The choice of application depends on the specific requirements of the problem to be solved.

C program for DFS algorithm with output

#include <stdio.h>
#include <stdlib.h>
#define MAX_VERTICES 100
typedef struct _graph {
 int num_vertices;
 int adj_matrix[MAX_VERTICES][MAX_VERTICES];
} Graph;
void DFS(Graph* graph, int vertex, int visited[]) {
 visited[vertex] = 1;
 printf("%d ", vertex);
 for (int i = 0; i < graph->num_vertices; i++) {
 if (graph->adj_matrix[vertex][i] == 1 && visited[i] == 0) {
 DFS(graph, i, visited);
 }
 }
}
int main() {
 Graph graph;
 int visited[MAX_VERTICES] = {0};
 printf("Enter the number of vertices: ");
 scanf("%d", &graph.num_vertices);
 printf("Enter the adjacency matrix:\n");
 for (int i = 0; i < graph.num_vertices; i++) {
 for (int j = 0; j < graph.num_vertices; j++) {
 scanf("%d", &graph.adj_matrix[i][j]);
 }
 }
 printf("DFS traversal starting from vertex 0: ");
 DFS(&graph, 0, visited);
 return 0;
}

This program takes input for the number of vertices and the adjacency matrix of a graph and then performs a DFS traversal starting from vertex 0. The output is the list of vertices visited during the traversal.

Here's an example output for a sample input graph:

Sample Output

Enter the number of vertices: 5. Enter the adjacency matrix:
0 1 1 0 0
1 0 0 1 1
1 0 0 1 0
0 1 1 0 1
0 1 0 1 0
DFS traversal starting from vertex 0: 0 1 3 4 2

In this example, the input graph has five vertices, and the adjacency matrix indicates the edges between them. The DFS traversal starts from vertex 0 and visits the vertices in the order 0, 1, 3, 4, 2.

Applications of the DFS algorithm

DFS, or Depth First Search, is a versatile algorithm that can be used in many applications involving graph traversal and analysis. Here are some of the more common applications of DFS:

  1. Finding Connected Components: DFS can be used to identify all connected components in a diagram. The algorithm starts at an arbitrary vertex and explores all connected vertices in this application. All unvisited vertices are used as starting points for new DFS searches until all connected components are identified.
  2. Identifying Cycles: DFS can identify cycles in a chart. This is done by keeping a list of vertices visited during the search and checking for cycles identifying possible back edges (edges connecting a vertex to an ancestor in the DFS tree). If a trailing edge is found, it indicates the presence of a cycle.
  3. Topological sorting: DFS can be used for topological sorting of a directed acyclic graph (DAG). In this application, the algorithm gives each vertex a temporary label when it is first visited and a permanent label when all its neighbors have been visited. The vertices are then sorted in reverse order of their fixed signs, resulting in a topologically ordered list.
  4. Path Find: DFS can be used to find a path between two graph vertices. For this purpose, the list of visited points during the search and the journey record from the starting point to the current high point is kept. The stored path is returned as the solution if the destination is reached during the search.
  5. Network Flow Analysis: DFS can analyze network flows in a graph. This involves assigning capacity to the graph's edges and then using DFS to find additional paths (flow-increasing paths) from the source to the sink. This can be used to find the maximum current in the network.
  6. Maze creation and solving: DFS can be used to create and solve mazes. When creating a maze, the algorithm starts at a random cell and uses DFS to traverse the maze until all cells have been visited. In the maze solution, the algorithm explores the maze using DFS until the target cell is found.

Advantages of the DFS algorithm

The Depth First Search (DFS) algorithm has several advantages, making it popular for graph traversal and analysis.

  1. Simplicity: DFS is a relatively simple algorithm, requiring only basic data structures such as stacks or queues to keep track of visited vertices and the current path.
  2. Memory efficiency: DFS uses less memory than graph traversal algorithms such as BFS (breadth first). This is because DFS only needs to store the current path, while BFS needs to store all points at each level.
  3. Versatility: DFS is a versatile algorithm that can be used in many applications, including connection component finding, cycle detection, topological sorting, pathfinding, network flow analysis, and maze generation and solving.
  4. Time efficiency: In some cases, DFS can be faster than other algorithms, such as BFS, for certain types of graphs. This is because DFS explores the graph along a single path, which can be more efficient for specific problems.
  5. Flexibility: DFS can be implemented using recursion or an explicit stack or queue, providing flexibility in choosing the best implementation for a given problem.
  6. Spatial complexity: DFS can have better spatial complexity in specific scenarios than other graph traversal algorithms. DFS is a robust algorithm that can be applied to many problems and balances efficiency, simplicity, and flexibility.

Disadvantages of the DFS algorithm

Although the DFS (Depth First Search) algorithm has several advantages, it also has some disadvantages that must be considered when choosing the appropriate algorithm for a given problem. Here are some of the main disadvantages of DFS:

  1. Completeness: DFS cannot find the shortest path between two vertices. Sometimes, it may find a longer path before finding the shortest one, which can be a problem for specific applications.
  2. Complexity of dense graphs: DFS can be inefficient for dense graphs because it can explore many unnecessary paths and vertices. As a result, runtime and memory usage may increase.
  3. Danger of infinite loops: DFS can get stuck in infinite loops if the algorithm does not detect cycles in the graph. This can be a severe problem, especially for large graphics.
  4. Sensitivity to starting point: The order in which DFS vertices are explored depends on the starting point. Different starting points can produce different results, which can be problematic for some applications.
  5. Stack Overflow Vulnerability: A recursive implementation of DFS can cause stack overflow errors if the graph depth is too large. This can be mitigated by using an explicit stack instead of recursion, but it makes the implementation more complex.

DFS is a robust algorithm with many advantages, but its disadvantages must be carefully considered before applying it to a specific problem. In some cases, other algorithms, such as BFS or Dijkstra's algorithm, may be more suitable.

The Complexity of the DFS algorithm

The time and space complexity of the DFS (Depth First Search) algorithm depends on the

size and structure of the graph. The time complexity of DFS is O(|V| |E|), where |V| is the number of vertices, and |E| is the number of edges in the graph. This is because the algorithm visits each vertex and edge at most once, and the time required to visit each vertex or edge is constant. But in the worst case, if the graph is complete (i.e., every vertex is connected to every other vertex), the time complexity of DFS becomes O(|V|^2).

The space complexity of DFS is O(|V|), where |V| is the number of vertices in the graph. This is because the algorithm uses a stack to track the current path, and the maximum size of the stack is equal to the depth of the recursion tree, which is equal to the number of vertices in the graph. In some cases, such as when an explicit stack is used instead of recursion, the DFS state complexity can be reduced to O(|E|), where |E| is the number of edges in the graph. The worst-case time and space complexity of DFS may not always be the most important factor when analyzing an algorithm. In practice, the structure of the graph and the specific problem to be solved can significantly affect the actual runtime and memory usage of DFS.

Conclusion

Depth First Search (DFS) is a popular algorithm for traversing a graph or tree data structure. The algorithm starts at the root node (or any other node) and explores as many branches as possible before returning. DFS uses the stack data structure to track which nodes are visited. One of the main advantages of DFS is that it requires very little memory compared to other routing algorithms, as it only needs to store nodes in the current path. However, it may need to find the shortest path between nodes because it explores deeper graph levels before moving to lower levels. The DFS algorithm can be implemented recursively or iteratively. In the recursive version, the algorithm calls itself to visit neighboring nodes, while in the iterative version, it uses the stack to keep track of the visited nodes.

In summary, DFS is a powerful and versatile algorithm that can be used to solve various problems involving graph or tree data structures. Its simple implementation and low memory requirements make it popular among developers and can be easily adapted to different needs. However, its suboptimal nature for finding the shortest path may make it unsuitable for specific applications.