Make edge layout and memory consumption configurable about graph

[geoah]

This is an interesting approach but I’m not sure how it would look in real life.

The method signatures would still return K/T specifically unless you want to make Edge() for example accept interface{} which would be kinda missing the point.

I might be missing something here.

ps. What happens to the methods that will come out of 25 that will have to use the graph in this case?
—-

Alternative would be having a different constructor? NewByValues(…) GraphByValues that has a different interface and basically is a wrapper for Graph (and also extends it)?

[dominikbraun]

So I played around quite a bit and tried to solve this by using two versions of inEdges and outEdges for storing the edges, one that stores Edge[T] and one that stores Edge[K] - and I really don't like it so far. Especially with the new Store interface in place, this will get confusing.

This would be the only way that would be ok for me, but of course, this doesn't work because of the type parameters: https://go.dev/play/p/Zi0H2EUNHa6

I agree that a wrapper type would be the cleanest way to solve this, if any. But I'd like to wait at least for #12 and #25, so I'm going to close this issue and create a new one once we exactly know what we're needing.