sdboyer / gogl

A graph library in Go
MIT License
77 stars 13 forks source link

Stop assuming that undirected graphs return edges with deterministically ordered vertices #18

Closed sdboyer closed 10 years ago

sdboyer commented 10 years ago

Right now, there are some things rooted in the assumption that undirected graphs produce edges (as in, send to EdgeLambdas) with a static, deterministic outcome as to which vertex is the Source() and which is the Target(). in particular, some of the builder/graph generation stuff implicitly relies on this.

this is a dangerous assumption, and not one that we should rely on. this should be made explicit, and surfaced however possible in any graph-sourcing/generation processes. somehow.

sdboyer commented 10 years ago

all wrapped up now