D graph library

[Joseph Rushton Wakeling]

On 05/15/2013 07:21 PM, Joseph Rushton Wakeling wrote:
> If you think about that in D terms you might start with arrays from and to, and
> e.g. edges() would return lockstep(from, to).

... actually, probably better to use zip(from, to).  Better still if there's
some way to combine this with labels like "from" and "to" (or "head" and "tail")
so that the user can do something like,

	foreach(e; g.edge)
		writeln(e.head, "\t", e.tail);