aalhour / aalhour/C-Sharp-Algorithms
Removing a vertex from an UndirectedSparseGraph is very slow, make it faster
Open
feature
- Dominant language
- C#
- Stars
- 6.2k
- Forks
- 1.4k
- PR merge metrics
- No merged PRs in 30d
Description
**Is your feature request related to a problem? Please describe.**
In an application, I have to create an UndirectedSparseGraph from which I then filter out (i.e. RemoveVertex) many nodes, which takes minutes for a graph of less than a thousand vertices.
**Describe the solution you'd like**
Optimally, this should be taking seconds, instead of minutes. I've created a pull request that achieves this: https://github.com/aalhour/C-Sharp-Algorithms/pull/130/
Contributor guide
Assessment
This issue has not been assessed yet.