update build version
update build version
Fixed a bug in CircularBuffer.entries() that returned an empty list when _end was not aligned with the internal buffer. Also modified entries() to use calls to slice() and concat() instead of a while loop and push()
Merge pull request #5 from emil-mi/master

Fixed a bug in CircularBuffer.entries() and some minor additions
Graph support : First checkin. Add undirected graph, BFS traversal, shortest path on unweightedd graph.. basic test case
Merge remote-tracking branch 'origin/master'
Graph support :Shortest path on weighted undirected graph. simple utilities to print vertex and parent. list all vertices in BFS traversal order. TODO: Only primitive types supported for vertices
Graph support :Topological sort order on directed graphs NOTE: Only primitive types supported for vertices
Skip List, hide delNode
hide adjacency initializer
Generalized DFS with topological sort order built on vertex visit callback
Generalized DFS - detect cycles in directed graphs
Generalized DFS - detect cycles for undirected graphs as well
Generalzed Vertex support - Vertex can be represented as number, string or any object. If its an object, an objectid property or function should be specified to identify the vertex
Generalized Vertex support - Vertex can be represented as number, string or any object. If its an object, an objectid property or function should be specified to identify the vertex
update package and index
update package and index
Allow setting log levels (debug switched off by default)
Basic Bloom Filter - First checkin
Bloom Filter - support any kind of objects for hashing