Study Glance
🌳
B.TECH I YEAR • II SEMESTER • R25

Data Structures - Lab Manual

Data Structures Laboratory • C Programming Solution

📘 R25 Regulation 🎓 I Year 📚 II Semester 💻 C Programming 🧪 Lab Program
Selected Program

C program to implement the Depth First search a graph traversal methods

← All Lab Programs

C program to implement the Depth First search a graph traversal methods

DFS 
#include <stdio.h>
int a[20][20], visited[20], n;
void dfs(int v) 
{
	int i;
    visited[v] = 1;
    for (i = 1; i <= n; i++)
	{
		if (a[v][i] && !visited[i]) 
		{
			printf("\n %d->%d", v, i);
            dfs(i);
        }
    }
}

int main( ) 
{
	int i, j,v, count = 0;
    printf("\n Enter number of vertices:");
    scanf("%d", &n);
    for (i = 1; i <= n; i++) 
	{
		visited[i] = 0;
        for (j = 1; j <= n; j++)
			a[i][j] = 0;
	}
    printf("\n Enter the adjacency matrix:\n");
    for (i = 1; i <= n; i++)
		for (j = 1; j <= n; j++)
			scanf("%d", &a[i][j]);
	printf("Enter the starting vertex: ");
    scanf("%d", &v);
	dfs(v);
    return 0;
}

OUTPUT
Enter number of vertices:6
Enter the adjacency matrix:
0 1 1 0 0 0
1 0 1 0 0 0
1 1 0 1 1 0
0 0 1 0 0 0
0 0 1 0 0 1
0 0 0 0 1 0
Enter the starting vertex: 2
2->1
1->3
3->4
3->5
5->6

💻 Run This C Program

C program to implement the Depth First search a graph traversal methods
The selected C program is loaded automatically. Edit the code, provide input through STDIN and click Run.

The compiler is embedded using OneCompiler. Your program runs in the embedded C environment; Study Glance does not execute C code directly on your web server.

Related Data Structures Lab Programs

🔗

Linked Lists

1. Write a program that uses functions to perform the following operations on singly linkedlist: i) Creation ii) Insertion iii) Deletion iv) Traversal. View Solution →
2. Write a program that uses functions to perform the following operations on doubly linkedlist: i) Creation ii) Insertion iii) Deletion iv) Traversal. View Solution →
3. Write a program that uses functions to perform the following operations on circular linkedlist: i) Creation ii) Insertion iii) Deletion iv) Traversal. View Solution →
📚

Stacks and Queues

1. C Program that implement Stack (its operations) using Array. View Solution →
2. C Program to implement Stack using Linked List(Pointer). View Solution →
3. C Program to implement Queue (its operations) using Array. View Solution →
4. C Program to implement Queue using Linked List(pointer). View Solution →
🔢

Sorting

1. Write a C program to implement Radix sorting. View Solution →
2. Write a C program to implement Heap sorting. View Solution →
3. Write a C program to implement Shell sorting. View Solution →
4. Write a C program to implement Tree sorting. View Solution →
🌳

Trees

1. Write a C program for tree traversal using Recursive method. View Solution →
2. Write a C program for tree traversal using Non Recursive method. View Solution →
3. Write a C program to implement Binary Search Tree. View Solution →
4. Write a C program to implement AVL Tree. View Solution →
5. Write a C program to implement Red-Black Tree. View Solution →
🕸️

Graph Traversal

1. Write a C program to implement Breadth First Search (BFS). View Solution →
2. Write a C program to implement Depth First Search (DFS). Current
#️⃣

Hashing

1. Write a C program to implement Hash Functions: Division, Multiplication, Mid-square and Folding methods. View Solution →
← Back to Data Structures Lab Programs 📚 All Lab Manuals