https://github.com/invisiblegaudi/bidijkstra

https://github.com/invisiblegaudi/bidijkstra

Last synced: 9 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/invisiblegaudi/bidijkstra
• Owner: invisiblegaudi
• Created: 2019-05-14T15:59:57.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2022-12-30T18:53:40.000Z (almost 2 years ago)
• Last Synced: 2024-10-04T09:20:10.439Z (3 months ago)
• Language: JavaScript
• Size: 413 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 11
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

        
Bidijkstra (Bi-directional Dijkstra Algorithm)

---

This package is a rewrite of the algorithmic component of an art project I did in Sept 2017 for the DeptfordX festival in London. It was intended to work with semantic graphs rather than the usual spacial.

Originally it was really OO style which is no longer cool, so I aim to make it more

* elegant

* immutable

* functional

In addition, I wanted it to

* have reusable components (where possible)

* work with an almost schema-less data i.e. most simplified expression of a graph data structure

* have a pure search function allowing extensibilty of node structure (not fully there yet)

* demonstrate the relationship & difference between searches

* make use of es6+

* be fun to write (e.g. no semicolons, yep.)

Usage

---

Right now if you want to use it you may only use a preset heuristic function and/or graph.

These are limited to enough for me to write tests but you can add your own.

Please see the examples file for more details

TODO

---

Obviously (at only v0.5) this just only works and there much more to do 

* more functional

* optimisation

* browser compatable

* chainable heuristic patterns

* 3rd party symantic graph support & JSON-LD

* fix the tests!

* lovely comments