Opened 9 years ago

Last modified 9 years ago

#15507 closed enhancement

Static sparse graphs on > 65536 vertices — at Version 2

Reported by: Nathann Cohen Owned by:
Priority: major Milestone: sage-6.1
Component: graph theory Keywords:
Cc: Simon King, David Coudert, Christian Stump Merged in:
Authors: Nathann Cohen Reviewers:
Report Upstream: N/A Work issues:
Branch: public/15507 (Commits, GitHub, GitLab) Commit:
Dependencies: Stopgaps:

Status badges

Description (last modified by Nathann Cohen)

On Sage-devel [1], Christian reported an humiliating error message :

sage: graphs.PathGraph(70000).diameter()       
ValueError: The graph backend contains more than 65535 nodes

This is because Sage's "static_sparse_graphs" are stored on unsigned short fields (and thus to 65536 vertices), and though this is a meaningful limitation for Sage's code to compute the "all pairs shortest path" (the distance between all pairs of vertices, i.e. a n2 matrix of integers), it does not make any sense to refuse to compute the diameter of such graphs.

Soooooooooo this patch changes these "unsigned short" to 32-bits unsigned integers (and note more, because that already doubles the memory requires), which is also good to have when Simon is about to use the same data structure for combinatorial graphs, which can be huge.

I have to mention that this does not make "diameter" answer very fast either on instances with more than 65536 vertices :-/

sage: %time graphs.PathGraph(70000).diameter()
CPU times: user 132.41 s, sys: 0.16 s, total: 132.57 s
Wall time: 133.42 s

But at least we can build them T_T

What this patch does:

  • change the type of the static_sparse_graph data structure from ushort to uint32_t, as well as the functions that use it
  • change the all_pairs_shortest_path_BFS function to first compute the distance on a int * array of length n. The values are then copied into the n^2 matrix of ushort if necessary. That's a loss of time, but it's either this or rewriting two versions of the function :-/
  • remove a useless degree variable in the same function
  • Some simplifications from place to place in the code



Change History (2)

comment:1 Changed 9 years ago by Nathann Cohen

Branch: public/15507
Description: modified (diff)
Status: newneeds_review

comment:2 Changed 9 years ago by Nathann Cohen

Description: modified (diff)
Note: See TracTickets for help on using tickets.