sauerbraten / graph Goto Github PK

I saw often in graph.go that you Lock() one graph, make something and right away you Unlock() it. I think you could directly defer every Unlock() per Lock() you do.
defer follows a LIFO pattern, so I don't think there would be any conflict on the functionality having some defers on the same method.

Correct me if I'm wrong. 📣

Hi there, I'm wondering what you think about extending the edge struct to support an interface{} instead of int, much like a Vertex supports an interface.

Here's what I'm trying to do:

I have a list of flights connecting airports and I know the departure and arrival time of the flight and I know the cost of the flight. I'm able to use graph (thank you!) to calculate the cheapest and the quickest route. The problem is that I have to build the graph twice: once with duration stored in the edges and once with cost stored in the edges. This is because it's not which airports I hit that I'm concerned with, it's which flight I must take to get there.

Let me know what you think. Also, is this something you would accept a pull request for ?