CSE 404 193002041 Shoeb
CSE 404 193002041 Shoeb
CSE 404 193002041 Shoeb
LAB REPORT NO # 01
Course Title: Artificial Intelligence Lab
Course Code: CSE-404 Section: 193D3
Student Details
Name ID
Md Shoeb Sikder Pappu 193002041
[For Teachers use only: Don’t Write Anything inside this box]
Implementation
Graph
Code:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Stack;
class Edge
{
int source, dest;
class Graph
{
adjList.get(src).add(dest);
adjList.get(dest).add(src);
}
}
}
class Main
{
stack.push(v);
while (!stack.empty())
{
v = stack.pop();
if (discovered[v]) {
continue;
}
discovered[v] = true;
System.out.print(v + " ");
);
int n = 13;
Output:
Discussion:
Iterative deepening depth-first search is a hybrid algorithm emerging out of
BFS and DFS. IDDFS might not be used directly in many applications of
Computer Science, yet the strategy is used in searching data of infinite
space by incrementing the depth limit by progressing iteratively. This is
quite useful and has applications in AI and the emerging data sciences
industry.