Tag Archives: toc

C program for dfs (depth first search)

c program for dfs(depth first search) using array. DFS is Depht first Search, which is used to traverse un-weighted Graph.  There are two most popular graph traversing technique, i.e DFS and BFS. DFs make use of Stack while, BFS make use data structure Queue. Also see c program for bfs. C program for dfs #include<stdio.h> #include<conio.h> char stack[20]; int … Continue reading C program for dfs (depth first search)

C program for bfs (breadth first search)

C program for bfs (breadth first search) using array. BFS is Breadth first Search, which is used to traverse unwieghted Graph. There are two most popular graph traversing technique, i.e DFS and BFS. DFs make use of Stack while, BFS make use data structure Queue. Also see c program to implement DFS. C program for bfs … Continue reading C program for bfs (breadth first search)

c program for dfa (deterministic finite automata)

c program for dfa (deterministic finite automata). Let us first know what is DFA or let us again revise the concept of DFA? Automation are basically language acceptor or language recognizer. A finite automata is a collection of 5-tuple(Q,∑,∂,q0,F). Where Q=finite set of states ∑=input symbol ∂=transition function q0=initial state F=set of final state c program for dfa #include<stdio.h> #include<conio.h> … Continue reading c program for dfa (deterministic finite automata)