New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

graph.add and iadd should use addN and not just repeat add N times #181

Closed

ghost opened this issue Feb 20, 2012 · 2 comments

Labels

ghost commented Feb 20, 2012

gromgull, 2011-10-10T14:48:39.000Z

Subject says all.

If the underlying store supports addN this may be faster!

gromgull closed this as completed in

ca4085f

Member

gromgull commented Jul 21, 2012

it only makes sense for iadd, since add/sub always create a new in memory graph anyway, where addN doesnt make any difference.

Member

gromgull commented Jul 21, 2012

(but see #225)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment