Salt is an abstract and graph based meta model for dealing with linguistic annotated data. Salt describes a minimum of semantic and only handles the structure of linguistic data.
Salt is an abstract and graph based meta model for dealing with linguistic annotated data. Salt describes a minimum of semantic and only handles the structure of linguistic data.
Salt is an abstract and graph based meta model for dealing with linguistic annotated data. Salt describes a minimum of semantic and only handles the structure of linguistic data.
Many-World Graph Database
SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.
SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.
A Java class library for graph-theory data structures and algorithms.
A Java class library for graph-theory data structures and algorithms.
A Java class library for graph-theory data structures and algorithms.
ODBOGM let you store/retrieve objects in a OrientDB graph structure in a clear and simple way.
A Java class library for graph-theory data structures and algorithms.
[clojars-forks] A data structure for representing dependency graphs
Neo4j is a graph database. It is an embedded, disk-based, fully transactional Java persistence engine that stores data structured in graphs rather than in tables.
A Java class library for graph-theory data structures and algorithms.
A Java class library for graph-theory data structures and algorithms.
SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.
SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.
Knowledge Flow visualization component for displaying tree and graph structures from those schemes that can output them. This component is an alternative to the Knowledge Flow's built-in GraphViewer and uses the PrefuseTree and PrefuseGraph packages which, in turn, use the prefuse visualization library.
SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.
First Class Properties allows navigating an object graph using a property path verified at compile time and having extensive property change support to listen for changes within that structure.
First Class Properties allows navigating an object graph using a property path verified at compile time and having extensive property change support to listen for changes within that structure.
First Class Properties allows navigating an object graph using a property path verified at compile time and having extensive property change support to listen for changes within that structure.
n.mapper is a fork of the great a-mapper -> a-mapper is a an extremely flexible and highly configurable library for mapping and diffing object graphs and other data structures into each other
A Java class library for graph-theory data structures and algorithms.
A Java class library for graph-theory data structures and algorithms.
Basic graph data structures and algorithms.
Graph data structure and algorithms