Talk:Topological sort: Difference between revisions

Content added Content deleted

Inline

Revision as of 20:09, 1 September 2009 (view source) Rdm (talk \| contribs) m (→‎J implementation) ← Older edit		Revision as of 22:18, 1 September 2009 (view source) rosettacode>Dkf (→‎J implementation) Newer edit →
Line 27:		Line 27:

	This implementation is a bit naive, since a connection matrix is O(n^2) in space and O(n^3) in time for n dependencies. If this matters, I should probably rewrite the code (and these comments) to use the tree structure mentioned at http://www.jsoftware.com/jwiki/Essays/Tree%20Sum#Descendants		This implementation is a bit naive, since a connection matrix is O(n^2) in space and O(n^3) in time for n dependencies. If this matters, I should probably rewrite the code (and these comments) to use the tree structure mentioned at http://www.jsoftware.com/jwiki/Essays/Tree%20Sum#Descendants

			: I look forward to when you distill this into the J solution. (Maybe provide it twice, once in expanded form with annotations?) —[[User:Dkf\|Donal Fellows]] 22:18, 1 September 2009 (UTC)