Iterate
Iterate with LinkList
class GFG
{
public static void bfs(int s, ArrayList<Integer> adj[],boolean visited[])
{
visited[s]=true;
LinkedList<Integer> queue=new LinkedList<>();
queue.add(s);
while(!queue.isEmpty())
{
int temp=queue.poll();
System.out.print(temp+" ");
Iterator<Integer> ir=adj[temp].listIterator();
while(ir.hasNext())
{
int t=ir.next();
if(!visited[t])
{
visited[t]=true;
queue.add(t);
}
}
}
}
}
public void DFS(int v,LinkedList<Integer> adj[],boolean visited[])
{
visited[v]=true;
System.out.print(v+" ");
Iterator<Integer> ir=adj[v].listIterator();
while(ir.hasNext())
{
int t=ir.next();
if(!visited[t])
{
DFS(t,adj,visited);
}
}
}
class GFG
{
public static void bfs(int s, ArrayList<Integer> adj[],boolean visited[])
{
visited[s]=true;
LinkedList<Integer> queue=new LinkedList<>();
queue.add(s);
while(!queue.isEmpty())
{
int temp=queue.poll();
System.out.print(temp+" ");
Iterator<Integer> ir=adj[temp].listIterator();
while(ir.hasNext())
{
int t=ir.next();
if(!visited[t])
{
visited[t]=true;
queue.add(t);
}
}
}
}
}
public void DFS(int v,LinkedList<Integer> adj[],boolean visited[])
{
visited[v]=true;
System.out.print(v+" ");
Iterator<Integer> ir=adj[v].listIterator();
while(ir.hasNext())
{
int t=ir.next();
if(!visited[t])
{
DFS(t,adj,visited);
}
}
}
Important information shared. We publish study books and published many books on computer programming. This comes under our interest as well. Book Publishers India
ReplyDelete