search

scijs / contributing

Contribution guide lines
10 stars 0 forks source link

Graph algorithms #11

Open mikolalysenko opened 9 years ago

mikolalysenko commented 9 years ago

There is a lot of stuff on npm, but even more big pieces are still missing. Specifically, there still isn't anything good for doing network flow. Ideally, it would be nice to have multiple algorithms:

Also as a supplement, having some solutions to the min-cost variant would be cool too.

It would also be nice to have some tools for computing approximations to various NP-hard graph problems like tree decomposition, clique finding, and so on.

prabod commented 8 years ago

https://github.com/prabod/Graph-Theory-Ford-Fulkerson i have done Ford-Fulkerson.will do other algorithms as well

prabod commented 8 years ago

https://github.com/prabod/Graph-Theory-Push-Relabel-Maximum-Flow Push-relabel

rreusser commented 8 years ago

Sorry for the delay following up on your questions! Pressed for time before I have to report for jury duty ( :disappointed: ) but will take a look and try to provide feedback ASAP. Thanks!

rreusser commented 8 years ago

Don't want to get ahead of you in case it's the direction you're headed (I see .travis.yml), but sooner or later it would very helpful to translate the examples into tests. Beyond superficial things though, I'll need to better familiarize myself with these algorithms before I can provide any meaningful feedback.

prabod commented 8 years ago

Thanks

prabod commented 8 years ago

readme and tests produced for both algos. need to publish as npm modules

mikolalysenko commented 8 years ago

This looks awesome!