Opened 7 years ago

Last modified 6 months ago

#16220 closed enhancement

Waste of time in iterator_edges 3 — at Version 1

Reported by: vdelecroix Owned by: vdelecroix
Priority: major Milestone: sage-duplicate/invalid/wontfix
Component: graph theory Keywords: graphs, datastructure
Cc: ncohen Merged in:
Authors: Vincent Delecroix Reviewers:
Report Upstream: N/A Work issues:
Branch: public/16220 (Commits, GitHub, GitLab) Commit: 98286f45fc077f9778708ca3f064a2f5a13853ad
Dependencies: Stopgaps:

Status badges

Description (last modified by vdelecroix)

Further optimizations for graph iterations following #16005.

The sparse graph backend (i.e. sage.graphs.base.sparse_graph.SparseGraph and sage.graphs.base.sparse_graph.SparseGraphBackend) lacks optimization especially for edge iteration. We need to see what is the best we can do and work on it!

Change History (1)

comment:1 Changed 7 years ago by vdelecroix

  • Branch set to public/16220
  • Commit set to 98286f45fc077f9778708ca3f064a2f5a13853ad
  • Description modified (diff)
  • Keywords graphs datastructure added
  • Type changed from PLEASE CHANGE to enhancement

New commits:

56ec117trac 16005: Waste of time in iterator_edges 2
567600btrac #16005: merge into 6.2.beta8
9623fd7Merge branch 'u/ncohen/16005' of trac.sagemath.org:sage into 16005-waste_of_times_graph2
98286f4optimization of edge_iteration in SparseGraphBackend + documentation
Note: See TracTickets for help on using tickets.