Inefficiency in overwriting of adjacency in undirected graphs

MaineKuehn / graphi

Graph Interface and Types

MIT License

1 stars 0 forks source link

Inefficiency in overwriting of adjacency in undirected graphs #2

Open eileen-kuehn opened 6 years ago

eileen-kuehn commented 6 years ago

The setting of new adjacency lists in undirected graphs is currently inefficient as first all existing edges are deleted before the new edges are inserted.

https://github.com/MaineKuehn/graphi/blob/a98ff1b26a80bd62d6c12df4c7d4ae287476278c/graphi/types/adjacency_graph.py#L114-L119