A Java-based implementation of XPath 1.0 that, in addition to XML processing, can inspect/modify Java object graphs (the library's explicit purpose) and even mixed Java/XML structures.

1.3 •

Neo4j kernel is a lightweight, embedded Java database designed to store data structured as graphs rather than tables. For more information, see http://neo4j.org.

5.19.0 •

A Java class library for graph-theory data structures and algorithms.

0.8.3 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

0.9.3 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

0.9.3 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

1.5.2 •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

The ELK Graph is the central data structure of the Eclipse Layout Kernel.

0.9.1 •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

An Xtext language for the ELK Graph data structure.

0.9.1 •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported.

0.5.1 •

TinkerPop3 Graph Structure Implementation for OrientDB

3.2.29 •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

Neo4j kernel is a lightweight, embedded Java database designed to store data structured as graphs rather than tables. For more information, see http://neo4j.org.

3.6.2 •

Fast and robust in-memory graph structure for large graphs written in Java

0.7.0 •

A Java class library for graph-theory data structures and algorithms.

1.2.0 •

A visualization component for displaying tree structures from those schemes that can output graphs (e.g. bayes nets). This component is available from the popup menu in the Explorer's classify. The component uses the prefuse visualization library.

1.0.4 •

A Java class library for graph-theory data structures and algorithms.

0.9.3 •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

A Java class library for graph-theory data structures and algorithms.

1.2.1-MODULARIZED •

Structured information from unstructured data

2.7.0 •

Reco4j is an open source project aims at developing a recommendation framework based on graph data sources. We choose graph databases for several reasons. They are NoSQL databases, so "schemaless". This means that it is possible to extend the basic data structure with intermediate information, i.e. similarity value between item and so on. Moreover, since every information is expressed with properties, nodes and relations, the recommendation process can be customized to work on every graph. Reco4j can be used on every graph where "user" and "item" is represented by node and the preferences are modelled as relationship between them. Current implementation leverage on Neo4j as first graph database integrated in our framework.

0.5.0 •

SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.

0.3.3 •

TinkerPop3 Graph Structure Implementation for OrientDB

3.2.3.0 •

SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.

0.3.3 •

SiNGA (Simulation of Natural Systems using Graph Automata) is an open-source library containing tools especially for structural bioinformatics and systems biology.

0.3.3 •

An Xtext language for the JSON ELK Graph data structure.

0.9.1 •

Android GraphView is used to display data in graph structures.

0.8.1 •

0.3.3 •

0.3.3 •

Structured information from unstructured data

2.7.0 •

A data structure for representing dependency graphs (mirrored from Clojars by JUXT)

1.0.0 •

A Java class library for graph-theory data structures and algorithms.

0.9.3 •

0.3.3 •

0.3.3 •

A small API for graph data structures

0.80 •

A data structure for representing dependency graphs

0.2.1 •

The SiNGA mathematics package handles most of the algorithms and data structures with mathematical background. Amongst others: affinity propagation, graph isomorphism, or voronoi diagram creation.

0.7.0 •

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.

2.1.2 •

A Java class library for graph-theory data structures and algorithms.

1.5.1.1 •

0.7.0 •