Write a C++ program for the Block DFS algorithm for the connectivity in the undirected graph your output should be in the similar form as in the image given below. The link given below has the implementation of the block DFS algorithm.

https://books.google.com/books?id=Be6t04pgggwC&pg=PA26&lpg=PA26&dq=block+dfs+algorithm&source=bl&ots=VHwnqvVNPh&sig=E3QwqBSo7dsgsvgy6vFm4dpWddU&hl=en&sa=X&ved=0ahUKEwjo5rWG3qvXAhUGZCYKHaVXCwMQ6AEITzAE#v=onepage&q=block%20dfs%20algorithm&f=false

a o 0: c patento b 00: df parent: 0 c00: a e parent: o d 0 0: a bef parent:0 e 00: c d parent: 0 t 0 0: b dgh parent: 0 g 00: f parent: 0 h 00: f parent: 0 DFS (a) num (a) pred (a) trying edge (ac) push (edge (ac)) DFS (c) -1 num(c) pred (c)2 trying edge (ca) trying edge (ce) push (edge (ce)) DES (e) num (e) = pred (e) trying edge (ec) trying edge (ed) push (edge (ed) ) DFS (d) -3 num (d) pred (d) -4 trying edge (da) push (edge (da)) pred2(d) -1 (= num (a)) trying edge (db) push (edge (db)) DES (b) num (b) = pred (b) trying edge (bd) trying edge (bf) push (edge (bf)) DFS (f) 5 = num (f) = pred (f) = 6 trying edge (fb) trying edge (fd) push (edge(fd) ) pred2(f) 4 (= num (d)) trying edge (fg) push (edge (fg) ) DFS (g) num (g) pred (g) -7 trying edge (gf) BLOCK: edge (fg) trying edge (fh) push (edge (fh)) DFS (h) num (h) = pred (h) trying edge (hf) 8 BLOCK: edge (fh) pred (b) 4 pred (f)) BLOCK: edge (fd) edge (bf) edge (db) trying edge (de) trying edge (df) pred (e) = 1-pred(d)) pred (c) -1 (= pred(e)) BLOCK: edge (da) edge (ed) edge (ce) edge (ac) trying edge (ad) a 11: c d parent: 0 b 5 4: d f parent: d c 2 1: a e parent: a d 4 1: a bef parent: e e 3 1: c d parent: c E 6 4: bdgh parent: b parent: f h 8 8: f parent: f