search

WebDrake / Dgraph

Graph library written in D.
GNU General Public License v3.0
45 stars 6 forks source link

isEdge and edgeID methods are suboptimal #4

Open WebDrake opened 10 years ago

WebDrake commented 10 years ago

The current implementations of isEdge and edgeID use a linear search. This should be replaced by a binary search that takes advantage of the sorting of head and tail indexes.

WebDrake commented 10 years ago

Probably the best way to fix this is via a solution to https://d.puremagic.com/issues/show_bug.cgi?id=11667 after which it should be possible to use std.algorithm.find.