You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently there's no built-in way to find all the edges between to vertices and it feels like the Graph ought to be able to do that. (It would handle the wrinkle of bi-directional edges too).
Maybe get_edges_between(from_vertex, to_vertex) returns an array of edges (possibly empty) but...
get_edge_between(from_vertex, to_vertex [,chooser]) returns just one (possibly null) — in graphs where there are no duplicate edges, having to handle the array will be an annoyance. There's already a chooser defined in the GraphVertex.get_edge_to(to_vertex, chooser) method.
The text was updated successfully, but these errors were encountered:
Currently there's no built-in way to find all the edges between to vertices and it feels like the Graph ought to be able to do that. (It would handle the wrinkle of bi-directional edges too).
Maybe
get_edges_between(from_vertex, to_vertex)
returns an array of edges (possibly empty) but...get_edge_between(from_vertex, to_vertex [,chooser])
returns just one (possiblynull
) — in graphs where there are no duplicate edges, having to handle the array will be an annoyance. There's already achooser
defined in theGraphVertex.get_edge_to(to_vertex, chooser)
method.The text was updated successfully, but these errors were encountered: