Tag Archives for Data Structure and Algorithm
BFS and DFS
Breadth First Traversal and Depth First Traversal #include<stdio.h> int q[ 20 ], top = -1, front = -1, rear = -1, a[ 20 ][ 20 ], vis[ 20 ], stack[ 20 ]; int delete(); void add( int item … Continue reading