Topological Sort and Strongly Connected Components
From Connected Components of Chaos · · 14 min
This plays from the publisher's own server. We do not host a copy.
Not rated yet
Description
This podcast reviews key concepts related to Depth First Search (DFS) algorithm and its application in topological sorting and finding strongly connected components in graphs.
Visit our website here:https://sites.google.com/view/connected-components/home