Go: Strongly Connected Components in Graphs

Lajos Deme
Jun 24 · 4 min read

Find SCCs in directed graphs with Golang

Photo by Alina Grubnyak on Unsplash

Imagine you have to write code to discover groups inside a social network, so then you can suggest them to follow each other or to like some page based on their shared interest.

People in the network can be represented as the vertices of a graph, and the groups as the strongly connected components of it.