diff options
| author | David Lamparter <equinox@opensourcerouting.org> | 2017-01-26 06:56:48 +0100 |
|---|---|---|
| committer | David Lamparter <equinox@opensourcerouting.org> | 2017-01-26 07:05:56 +0100 |
| commit | 5bf313994d01bc05f0fe90fdb69322812c399440 (patch) | |
| tree | 36ba2fb8c91fdf8f1b6a4fa7ad16993f1879a891 /lib/vector.c | |
| parent | 72d98ee94360a5da0af76d8e800a72c8d51c48b5 (diff) | |
lib: graph: speed up node deletion
We don't need to copy the from/to arrays, we can just iterate backwards.
NB: this makes graph_remove_edge delete only one edge (which is more
consistent with graph_add_edge allowing parallel edges).
Iterating graph->nodes backwards also makes graph_delete_graph faster
since that also iterates backwards.
Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
Diffstat (limited to 'lib/vector.c')
0 files changed, 0 insertions, 0 deletions