Ahmedabad University - Ahmedabad, India
The Event is to provide an understanding of BFS and DFS with an hands-on experience. This topic is an integral part of Graphs in Data Structures and Algorithms(DSA).
Many Programming Club members were facing problems in learning and implementing Breadth-First Search (BFS) and Depth First Search (DFS) - two fundamental concepts of Graph Theory. They are important algorithms with profound applications. Algorithms, in general, are an extremely important topic in Computer Science.
Contact Us
