Add a feature to find n consecutive free computers

[chpatrick]

No description provided.

[petehamilton]

Was literally about to add this myself...

[chpatrick]

You need to take into account machines in one group that aren't next to each other and machines in different groups that are.

[chpatrick]

It's probably easiest if you build a graph of computers next to each other and do some kind of traversal, don't know how you would go about that in JS.

[petehamilton]

You could always just do a script in perl/python which did the traversal and returned lists of connected machines?

In JS I guess you could do some class based implementation, the graph isn't very big so it wouldn't be too processor heavy for clients.

On 30 Nov 2011, at 17:13, vahokif wrote:

It's probably easiest if you build a graph of computers next to each other and do some kind of traversal, don't know how you would go about that in JS.

---

Reply to this email directly or view it on GitHub:
#1 (comment)

[chpatrick]

I'll make an adjacency list JSON as soon as my home directory server comes back up.

[chpatrick]

And yeah, it's an almost-linear graph, apart from a cycle for the circle of fusions in the middle.