I have a graph $G=(V,E)$ that consists of many disconnected directed subgraphs, some of them may be cyclic. (Basically a "forest" consisting of directed trees and some directed disconnected cyclic graphs added into it).
I want to find all of these disconnected subgraphs and turn them into stars given by the key of the node.
I've built a directed graph (using Python's
networkx library) and now I am kinda stuck how to find those disconnected subgraphs, because some of those subgraphs will have source and some of those wont.
How to proceed? Thanks!