DS and Algorithms (GATE 2014 set 2 QUESTION 3)

preview_player
Показать описание
Consider the trees arcs of a BFS traversal from a source node W in an unweighted ,connected , undirected graph. The tree T formed by the tree arcs is a data structure for computing.
#Gatecs2014QNA #Datastructure #Algorithms #Appliedcourse #gatecse #Computerscience
Рекомендации по теме