[cs63201] Question

Mikhail Nesterenko mikhail at cs.kent.edu
Tue Dec 13 13:57:59 EST 2011


> It is accurate to say that a knot is a strongly connected subgraph
> with no sinks and no sources?

If a directed graph is strongly connected, it already means that it
does not have sinks or sources.

Thanks,
-- 
Mikhail


More information about the cs63201 mailing list