search

TimFinucane / Ainur

Solution for parallel task scheduling problem, inspired by the tale of the Lord of the Rings
Other
5 stars 0 forks source link

Allow algorithm to iterate all nodes of graph #22

Closed TimFinucane closed 6 years ago

TimFinucane commented 6 years ago

Certain parts of the algorithm, e.g. getting total cost of all nodes, would be made simpler with a method of iterating the nodes of the graph.

maddiebeagley commented 6 years ago

whereabouts did you think this should be added? Are you suggesting we add a "getNodes()" method in Graph that returns them so you can iterate through? or do you mean iterate through all the nodes in a schedule /processor?

TimFinucane commented 6 years ago

Possibly some kind of getNodes() in graph. The only reason at the moment it would be useful is for the case mentioned above, calculating the total sum cost of all nodes in the grpah, and as this is a temporary solution we may not need to do this.

TimFinucane commented 6 years ago

It been done