sdboyer / gogl

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

Figure out good approach when building directed from undirected #21

Closed sdboyer closed 10 years ago

sdboyer commented 10 years ago

The conversion between directed and undirected graphs is a fundamentally lossy process - directed graphs contain data that undirected graphs simply do not. This issue is to figure out the best approach for handling a conversion "from" one type into the other (like, in a builder context).

a perfectly valid answer would be to simply not allow it.

the question of going from directed to undirected is less difficult; in the event that two vertices are connected by directed edges in both directions, they can simply be conjoined into one. or maybe it can be configurable behavior. either way, it's not hard.

sdboyer commented 10 years ago

all wrapped up now