Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/fabianmurariu/maze4dart
In memory Graph library for Dart
https://github.com/fabianmurariu/maze4dart
Last synced: about 17 hours ago
JSON representation
In memory Graph library for Dart
- Host: GitHub
- URL: https://github.com/fabianmurariu/maze4dart
- Owner: fabianmurariu
- Created: 2012-10-09T22:11:24.000Z (over 12 years ago)
- Default Branch: master
- Last Pushed: 2012-10-28T18:27:42.000Z (about 12 years ago)
- Last Synced: 2023-03-30T03:11:22.401Z (almost 2 years ago)
- Language: Dart
- Size: 195 KB
- Stars: 5
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
maze4dart
=========
In memory property graph library written in Dart
------------------------------------------------
Features:
* Assign any property to nodes
* Assign any property to relationships
* Graph is by default directed
* Nodes can filter relationships by type and properties
* Lookup nodes/relationships by id or indexed properties
* Automatic index on declared properties
* Simple Index implementation for manual indexing
* Versatile traversal API inspired by neo4j
Create a simple graph, look for relationships via "knows" property:
Node Rels
1. 2 4
2. 1 4
3. 1
4. 2 3
Code:
```java
Graph graph = new GraphImpl(["knows"]);
/* 4 nodes */
Node n1 = graph.createNode();
Node n2 = graph.createNode();
Node n3 = graph.createNode();
Node n4 = graph.createNode();
/* 7 edges */
Relationship rel1 = n1.createRelationship(n2, props:{"knows":2});
Relationship rel2 = n2.createRelationship(n1, props:{"knows":1});
Relationship rel3 = n2.createRelationship(n4, props:{"knows":4});
Relationship rel4 = n4.createRelationship(n3, props:{"knows":3});
Relationship rel5 = n4.createRelationship(n2, props:{"knows":2});
Relationship rel6 = n3.createRelationship(n1, props:{"knows":1});
Relationship rel7 = n1.createRelationship(n4, props:{"knows":4});
/* get relationships by INCOMING/OUTGOING*/
n1.getRelationships(Direction.OUTGOING);//[rel1,rel7];
n1.getRelationships(Direction.INCOMING);//[rel2,rel6];
n2.getRelationships(Direction.OUTGOING);//[rel2,rel3];
n2.getRelationships(Direction.INCOMING);//[rel1,rel5];
n3.getRelationships(Direction.OUTGOING);//[rel6];
n3.getRelationships(Direction.INCOMING);//[rel4];
n4.getRelationships(Direction.OUTGOING);//[rel4,rel5];
n4.getRelationships(Direction.INCOMING);//[rel3,rel7];
/* autoindex */
g.getRelationshipIndex().get("knows", 1);//[rel2,rel6]);
g.getRelationshipIndex().get("knows", 2);//[rel1,rel5]);
g.getRelationshipIndex().get("knows", 3);//[rel4]);
g.getRelationshipIndex().get("knows", 4);//[rel3,rel7]);
```
Below is a simple excerpt from the test package which does a DFS then a BFS throught a binary tree
```java
/* the tree is a directed graph where the parrent points to the children:
* n0(root)
* / \
* n1 n2
* / \ / \
* n3 n4 n5 n6
* /\ /\ /\ /\
* n7 n8 n9 n10 n11 n12 n13 n14
* */
test("dfs_traversal",(){
Traversal t = new Traversal().depthFirst();
Iterable traversal = t.traverse(root);
eval([[0],
[0,2],
[0,2,6],
[0,2,6,14],[0,2,6,13],
[0,2,5],
[0,2,5,12],[0,2,5,11],
[0,1],
[0,1,4],
[0,1,4,10],[0,1,4,9],
[0,1,3],
[0,1,3,8],[0,1,3,7]],traversal,true);
});
test("bfs_traversal",(){
Traversal t = new Traversal().breadthFirst();
Iterable traversal = t.traverse(root);
eval([[0],
[0,1],[0,2],
[0,1,3],[0,1,4],[0,2,5],[0,2,6],
[0,1,3,7],[0,1,3,8],[0,1,4,9],[0,1,4,10],[0,2,5,11],[0,2,5,12],[0,2,6,13],[0,2,6,14]],traversal,true);
});
```
This is a BFS search with a custom evaluator that only includes the path with the end-node id 12
```java
test("bfs_search",(){
Node end = g.getNodeById(12);
Traversal t = new Traversal().breadthFirst().addEvaluator((Path p) {
if (p.endNode() == end)
return Evaluation.INCLUDE_AND_CONTINUE; /* only include the path with the end node */
return Evaluation.EXCLUDE_AND_CONTINUE;
});
Iterable traversal = t.traverse(root);
eval([[0,2,5,12]],traversal,true);
});
```
You can find all the tests above in test.dart