dxnn/dagoba

A tiny in-memory graph database

Dagoba

A tiny, extensible in-memory graph database

dagoba's Issues

Single User vs Multiple Users

What changes, if any, would you make if you knew going in that the db would only ever be single-user (but not necessarily single-threaded). My intentions are to develop an in-memory graph for single player text games, but I could see the need to traverse the graph with multiple queries at once.

Query Examples

Greetings,

Just get started with the lib to use as a backend for a graph visualization interface. Will be writing queries to return results that can be visualized. Reading through the documentation and running the example / tests, it looks like the queries only return the nodes, but not the edges. Can you provide an example of running a query such that the results provide the nodes and edges for the entire path? In other words, if search is get parent and its children (2), I would expect a return of three nodes and two edges.

Thanks for your assistance! Great work!!!