DataStructures.Algorithms

DataStructures.Algorithms copied to clipboard

Make use of Guid for Vertex comparision

1

- [ ] Define or extend interface of IVertex which makes it possible to use the internal `Guid` for comparision of vertex1 and vertex2; Possible candidate `IComparable or IEquatable` -...

mfe-

mfe-

Keeping the whole vertex /edge list in memory allocates too much space in some scenarios. When iterating over vertices /edge list, it should be possible to outsource them (for example...

mfe-

mfe-

To be able to set the CornerRadius in the VertexControl a CornerRadius DP should be created

mfe-

When setting a custom width and height >40 on the `VertexControl` on a directed graph the arrow is underneath the control. Therefore it looks like that the arrow isn't displayed....

mfe-