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

Improve graph edge access times #9

Closed TimFinucane closed 6 years ago

TimFinucane commented 6 years ago

Improve access times to graph. This can be done by using lists instead of maps and maintaining indices. This task is not necessary but is possible and helpful. Should also not require much if all changes to exterior interface

TimFinucane commented 6 years ago

So as @emipeanz pointed out, the node labels in the example graphs are integers starting at 0. If we use these and have labels as integers instead of strings, it becomes trivial to convert the rest to ArrayList, potentially even removing the label from Node.

emipeanz commented 6 years ago

As per email we cannot guarantee that the nodes will be labelled by integers so will have to work with strings

TimFinucane commented 6 years ago

Optimization is still possible, with at most the addition of a getId() to Node public interface.