Am 01.11.19 um 03:17 schrieb Adrien Dulac:
On 10/31/19 9:37 PM, Tiago de Paula Peixoto wrote:
Am 31.10.19 um 21:23 schrieb Adrien Dulac:
The change for get_edges() is a just a matter of consistency, after the function was generalized to return arbitrary properties as well (as opposed to only the edge index).
The change for property maps never happened, since it was never possible to access edge property maps with node tuples. I don't understand, I was able to do the following before 2.29 ?
|eprop = g.new_ep('int') eprop[0,2] # worked if there is an edge between node 0 and 2 |
? I don't remember this ever being possible.
Best, Tiago
Ok, but in this case, is there a way to avoid the complexity of calling `g.edge` to get a edge property, if we know the indexes i and j of the nodes? what would be to best way to proceed ?
Graph-tool uses an adjacency list data structure, which does not allow for an O(1) random access to edges. The best that can be done is O(min(k_i, k_j)) which is what Graph.edge() does. -- Tiago de Paula Peixoto <tiago@skewed.de>