Skip to content
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.

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

put big algorithms in separate module #8

Open
mhelvens opened this issue May 14, 2015 · 1 comment
Open

put big algorithms in separate module #8

mhelvens opened this issue May 14, 2015 · 1 comment

Comments

@mhelvens
Copy link
Owner

In order to keep the core graph.js library light, larger algorithms like .paths(), .cycles(), .transitiveReduction() and .contractPaths() should be put in a separate companion library.

This is a breaking change that will wait for version 2.x.

@dominicbarnes
Copy link
Contributor

In addition to extracting these algorithms, personally I would find it helpful to have better descriptions for what they do. I'm fairly new to graphs as a whole, so some of the terminology makes it hard to grok the overall concept.

I'm thinking that having separate libraries would make it easier to dedicate time to explaining the concepts and providing some example use-cases.

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

No branches or pull requests

2 participants