Invited Talk: Dijkstra and Bellman-Ford Algorithms

On April 2, 2025, NIIT University hosted a virtual invited talk featuring Prof. Paul Talaga from the University of Indianapolis, USA. Held via Google Meet from 6:00 PM to 8:00 PM IST, the session was aimed at enhancing students’ understanding of core graph algorithms — Dijkstra and Bellman-Ford. Prof. Talaga’s clear, interactive teaching style made complex topics accessible and engaging. He began with shortest path problems in graph theory, then dove into the specifics of each algorithm, emphasizing their applications, strengths, and limitations. Using real-world examples, visual aids, and coding insights, he encouraged students to think both theoretically and practically. With active student participation and thoughtful questions throughout, the session proved to be highly enriching. The talk concluded with a vote of thanks and a group photo, leaving the NUtons community inspired to explore algorithm design further.