Changes between Version 2 and Version 9 of Ticket #15507
 Timestamp:
 12/10/13 16:50:40 (9 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #15507

Property
Commit
changed from
to
16b4b265b784192dab04950e8bd57060917d73a9

Property
Commit
changed from

Ticket #15507 – Description
v2 v9 7 7 }}} 8 8 9 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 n^2 matrix of integers), it does not make any sense to refuse to compute the diameter of such graphs.9 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 n^2^ matrix of integers), it does not make any sense to refuse to compute the diameter of such graphs. 10 10 11 11 Soooooooooo this patch changes these "unsigned short" to 32bits 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.