CrowLib

CrowLib copied to clipboard

This library might see more interest and adoption if I rip out all the Google Closure bits, which might have made sense 9 years ago, but hasn't for a long...

nanodeath

Dijkstra's wastes memory and time queuing nodes already in the queue

2

It also causes problems when using a function to filter and gather info as nodes are in the visited list more than once. If a node is already in the...

damium

Implement BFS-as-shortest-path algorithm

3

WIth fixed distances, BFS can be used to calculate a shortest path. It's faster than Dijkstra's, too.

nanodeath

On version CrowLib-0.6.1.tgz

kievechua

Hi, I noticed that there is an error when removing an edge or vertex in a connected graph (no x,y coordinates) . Here are some functions that I use to...

VincentBlouin

See https://developers.google.com/closure/library/docs/calcdeps

nanodeath

nanodeath

Use RaphaelJS. It's cool.

nanodeath