The story begins in 1956, when the Dutch computer scientist Edsger Dijkstra ... to reduce any directed graph to a combination of two special cases — DAGs and tight clusters — that were each easy to ...