DataStructures.Algorithms
DataStructures.Algorithms copied to clipboard
Make use of Guid for Vertex comparision
trafficstars
- [ ] Define or extend interface of IVertex which makes it possible to use the internal
Guidfor comparision of vertex1 and vertex2; Possible candidateIComparable<Guid> or IEquatable<IntPtr> - [ ] Adjust algo.
This issue is also realted to Too many collisions with <250000 edges when comparing with Edge.GetHashCode for transposed #9