/* Depth first search algorithm extends the current path as far as possible before backtracking to the lastchoice point and trying the next alternative path. Depth first search may fail to find a solution if it enters acycle in the graph. This can be avoided if we never extend a path to a node which it already contains.*/
Category: C Language
/*In graph theory, Breadth First Search (BFS) is a technique for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to visit the nodes that neighbor the currently visited node. The BFS begins at a root node and inspects all the neighboring nodes.
(1)What will be the output of the following program main() { float me = 1.1;
/* Program to implement translation of line #include<stdio.h> #include <graphics.h> #include <stdlib.h> #include <conio.h>
/*Program to implement rotation of a line #include <graphics.h> #include <stdlib.h> #include <stdio.h> #include <conio.h> #include<math.h>
/* program to implement scaling of triangle #include<stdio.h> #include<conio.h> #include<graphics.h> #include<process.h> #include<math.h>