Talk:Topological sort/Extracted top item: Difference between revisions

m
no edit summary
mNo edit summary
Line 13:
::::: I am sorry, but I am still not understanding you. So, I am going to ask some questions whose answers, I hope, will help me understand what you are getting at: What do you mean by "extract"? How would my result be any different than what it currently is? What part of the task specification have I failed to satisfy? Thanks! --[[User:Rdm|Rdm]] 16:05, 14 October 2010 (UTC)
::::: Ok, I have finally noticed the line in the python display which reads: "The top levels of the dependency graph are: top2 top1". But please note that the current task description does not ask for this to be displayed, and (I do represent this information internally, in the J implementation). Also, as near as I can tell, identification of the top levels is completely independent from displaying the compile order (it will be the same regardless of which files we are compiling). That said, if you are willing to update the task to ask that this be displayed, I will update my J implementation to display it. --[[User:Rdm|Rdm]] 16:12, 14 October 2010 (UTC)
:::::: Specifically: the top levels are identified by <code>(+./<+./"1)depends</code> after depends gets calculated and before the while loop where I destroy it. And the names of the top levels would be <code>names#~(+./<+./"1)depends</code>, and I could format and display them. However,But withit myis currentconceptually implementation,simpler thisto wouldextract getthe displayedtop everylevels timedirectly Ifrom askedthe forraw adependencies, compileand orderto (soignore itthis would be repeated 3 times for the three current examples)topology. --[[User:Rdm|Rdm]] 16:29, 14 October 2010 (UTC) (updated 20:59, 15 October 2010 (UTC))
 
Hi Rdm. The description includes this definition of what makes a top level:
6,962

edits