f8fdb6de3f
When creating a Set of BasicEdges, the Hashcode function is used to determine map keys for the underlying set data structure. The string hex representation of the two vertices' pointers is unsafe to use as a map key, since these addresses may change between the time they are added to the set and the time the set is operated on. Instead we modify the Hashcode function to maintain the references to the underlying vertices so they cannot be garbage collected during the lifetime of the Set. |
||
|---|---|---|
| .. | ||
| dag.go | ||
| dag_test.go | ||
| dot.go | ||
| dot_test.go | ||
| edge.go | ||
| edge_test.go | ||
| graph.go | ||
| graph_test.go | ||
| marshal.go | ||
| marshal_test.go | ||
| set.go | ||
| set_test.go | ||
| tarjan.go | ||
| tarjan_test.go | ||
| walk.go | ||
| walk_test.go | ||