## Types of edges involved in DFS and relation between them

Describe types of edges involved in DFS of a tree and directed & undirected graph and establish relation between them.

## Arrival and Departure Time of Vertices in DFS

Given a graph, find arrival & departure time of its vertices in DFS. Arrival Time is the time at which the vertex was explored for the first time in the DFS and Departure Time is the time at which we have explored all the neighbors of the vertex and we are ready to backtrack.

## Depth First Search (DFS) | Iterative & Recursive Implementation

Depth first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.

## Breadth First Search (BFS) | Iterative & Recursive Implementation

Breadth first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first, before moving to the next level neighbors.

## Graph Implementation in C++ without using STL

Given an undirected or a directed graph, implement the graph without using any data structure provided by any programming language library (e.g. STL in C++ or Collections in Java, etc). Implement for both weighted and unweighted graphs.

## Graph Implementation using STL

Given an undirected or a directed graph, implement the graph using any data structure provided by any programming language library (e.g. STL in C++ or Collections in Java, etc). Implement for both weighted and unweighted graphs.

## Terminology and Representations of Graphs

This post covers basic definition in terminologies associated with graphsÂ and covers Adjacency list and adjacency matrix graph representations of the graph. What is a Graph? A graph is an ordered pair G = (V, E) comprising a set V of vertices or nodes and a collection of pairs of vertices from V calledÂ edges of …

## Reverse a string using recursion

Write an recursive program to reverse a string efficiently.

## Reverse a string without using recursion

Write an iterative program to reverse a given string.

## Write a C Program without main function

Write a C or C++ program without using main function. We are allowed to change the entry point of the program from main() to any other function or remove the main() function altogether. 1. Using GCC _start function As per C/C++ standard, main() is the starting point of any program in a hosted …