The pseudo code of the function has been given. it must be written in C language.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

The pseudo code of the function has been given. it must be written in C language.

COMP 1123
Assignment 4
Yaşar University
Мay 8, 2021
Assignment
1. Implement the queue ADT and implement breadth-first traversal (BFT)
algorithm in graphs as a queue application. The details are given in
the latest version of Labwork 11.
2. Implement depth-first traversal (DFT) algorithm in graphs a stack ap-
plication as given below.
dft(g, s) //g is a graph, s is start vertex
t <- create a stack
dmap <- create a map of values for the vertices in g where the
value associated with each vertex is false
push s onto q
mark s as discovered in dmap
while t is not empty do
v <- pop from t
print "v is visited."
for all edges of the form (v,w) in g do
if w is not discovered in dmap then
push w onto q
mark w as discovered in dmap
endif
endfor
endwhile
end
Transcribed Image Text:COMP 1123 Assignment 4 Yaşar University Мay 8, 2021 Assignment 1. Implement the queue ADT and implement breadth-first traversal (BFT) algorithm in graphs as a queue application. The details are given in the latest version of Labwork 11. 2. Implement depth-first traversal (DFT) algorithm in graphs a stack ap- plication as given below. dft(g, s) //g is a graph, s is start vertex t <- create a stack dmap <- create a map of values for the vertices in g where the value associated with each vertex is false push s onto q mark s as discovered in dmap while t is not empty do v <- pop from t print "v is visited." for all edges of the form (v,w) in g do if w is not discovered in dmap then push w onto q mark w as discovered in dmap endif endfor endwhile end
void bft(int graph[][N], int start_vertex)
22日{
21
// Fill this block.
/*
QUEUE queue
size <- N
vmap <- memory allocation with "size" size which every elements are zero
enqueue (queue, init_integer(start_vertex))
vmap[start_vertex] = 1
print(start_vertex)
fflush(stdout)
while not isEmpty(queue) do
23
24
25
26
27
28
29
30
31
32
33
v <- dequeue (queue);
34
for i <- 0 to size do
if graph[v][i] != 0 and vmap[i] != 1 then
enqueue (queue, init_integer(i))
vmap[i] = 1
print(i)
fflush(stdout)
endif
35
36
37
38
39
40
endfor
endwhile
41
42
free(vmap)
*/
}
43
44
45
46
Transcribed Image Text:void bft(int graph[][N], int start_vertex) 22日{ 21 // Fill this block. /* QUEUE queue size <- N vmap <- memory allocation with "size" size which every elements are zero enqueue (queue, init_integer(start_vertex)) vmap[start_vertex] = 1 print(start_vertex) fflush(stdout) while not isEmpty(queue) do 23 24 25 26 27 28 29 30 31 32 33 v <- dequeue (queue); 34 for i <- 0 to size do if graph[v][i] != 0 and vmap[i] != 1 then enqueue (queue, init_integer(i)) vmap[i] = 1 print(i) fflush(stdout) endif 35 36 37 38 39 40 endfor endwhile 41 42 free(vmap) */ } 43 44 45 46
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY