Difference between revisions of "SimpleGraph"
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
"src" Directory can be handled as a gremlin graph: | "src" Directory can be handled as a gremlin graph: | ||
<source lang='java'> | <source lang='java'> | ||
| + | // create a new FileSystem acces supplying the result as a SimpleSystem API | ||
SimpleSystem fs=new FileSystem(); | SimpleSystem fs=new FileSystem(); | ||
| + | // connect to this system with no extra information (e.g. no credentials) and move to the "src" node | ||
SimpleNode start = fs.connect("").moveTo("src"); | SimpleNode start = fs.connect("").moveTo("src"); | ||
| + | // do gremlin style out traversals recusively to any depth | ||
start.recursiveOut("files",Integer.MAX_VALUE); | start.recursiveOut("files",Integer.MAX_VALUE); | ||
</source> | </source> | ||
Revision as of 16:08, 13 January 2018
SimpleGraph
SimpleGraph is an open source project that allows to wrap Systems APIs in a way that graph algorithms and storage can be applied. As an implementation Apache Gremlin/Tinkerpop is used.
FileSystem example
The graph below shows the source code structure for the SimpleGraph project. This graph visualization has been produced with the following Java lines which make sure that the "src" Directory can be handled as a gremlin graph:
// create a new FileSystem acces supplying the result as a SimpleSystem API
SimpleSystem fs=new FileSystem();
// connect to this system with no extra information (e.g. no credentials) and move to the "src" node
SimpleNode start = fs.connect("").moveTo("src");
// do gremlin style out traversals recusively to any depth
start.recursiveOut("files",Integer.MAX_VALUE);