Add logarithmic Fibonacci numbers algorithm
Fix worst-case DFS complexity
Reset global state between DFS runs
Add Kruskal's minimum spanning tree algorithm
Simplify matrix operations

Matrix-matrix and matrix-vector multiplication subroutines were monstrous and way too complicated for this 2x2 case. No generality is needed here.
Merge pull request #69 from eush77/fibonacci-logarithmic

Add logarithmic Fibonacci numbers algorithm
Merge pull request #70 from eush77/dfs-fixes

Reset global state between DFS calls, minor jsdoc fix
Include Kruskal's algorithm in main.js
Merge pull request #71 from eush77/kruskal

Add Kruskal's minimum spanning tree algorithm
Generalize DFS, make use of it in other algorithms
Merge pull request #73 from eush77/depth-first-search

Generalize DFS, make use of it in other algorithms
Contributors list
Remove license text from source files
Merge pull request #74 from felipernb/license

Single LICENSE file
Add contributors to package.json
AUTHORS extracted straight from git log: git log --format="format:%an <%ae>" | sort | uniq
Fix DFS complexity guarantee
Add Breadth-First Search
Add BFS shortest path algorithm
Create Graph::adjList and subobjects with null prototype (fix #76)