I was wondering if we can find the mother vertex in a directed connected graph by topological sorting. The last finished vertex will be the mother vertex.
Is this approach correct or am I thinking wrong?
Mother vertex in a graph.
I was wondering if we can find the mother vertex in a directed connected graph by topological sorting. The last finished vertex will be the mother vertex.
Is this approach correct or am I thinking wrong?