RSSAmplifier

Classic Logic · Jun 29, 2021

DFS Subtlety

0
Sign in to vote or save

This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.

I’ve been brushing up my algorithms knowledge during my free time. My preferred way to do this is working on Steven Skiena’s excellent Algorithm Design Manual . Depth-first traversal of graphs have struck me as being subtle. In this post I’m jotting down the subtleties involved in discovering back-edges, so that I don’t have to re-think it every time. Here’s a python…

Read on /post/dfs-subtlety/

Comments

Nothing yet. Say the first thing.

    Sign in to join the conversation.