CS Talk - Ozan Erat
Host: Holly Rushmeier
(Sample Class Lecture): Finding the shortest path on a graph using Dijkstra’s algorithm.
Abstract:
Single source shortest path algorithms are a widely used concept in software development. In this sample lecture, we will be discussing single source shortest path algorithms, specifically Dijkstra’s algorithm and its runtime complexity analysis from various aspects. Dijkstra’s algorithm, which is named after Edsger W. Dijkstra, solves the problem of finding the shortest path from a single source to all possible destinations within a graph.
Bio:
Ozan Erat is a Ph. D. candidate at Tufts University and a visiting lecturer at Mount Holyoke College located in western Massachusetts. He currently teaches Data Structures and Algorithms classes. His research interests include digital image processing and computer vision applications. He uses artificial intelligence tools and frameworks to conduct his research in several topics such as underwater color correction algorithms, skin cancer detection.