Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

OrientDB

Compare

  Analyzed 1 day ago

OrientDB is a deeply scalable Document-Graph DBMS with the flexibility of the Document databases and the power to manage links of the Graph databases. It can work in schema-less mode, schema-full or a mix of both. Supports advanced features such as ACID Transactions, Fast Indexes, Native and SQL ... [More] queries. It imports and exports documents in JSON. Graphs of hundreads of linked documents can be retrieved all in memory in few milliseconds without executing costly JOIN such as the Relational DBMSs do. OrientDB uses a new indexing algorithm called MVRB-Tree, derived from the Red-Black Tree and from the B+Tree with benefits of both: fast insertion and ultra fast lookup. [Less]

650K lines of code

0 current contributors

5 days since last commit

23 users on Open Hub

Moderate Activity
5.0
 
I Use This

Neo4j - the graph database

Compare

  Analyzed almost 3 years ago

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 graph (mathematical lingo for a network) is a flexible data structure that allows a more agile and rapid style of development.

881K lines of code

1 current contributors

over 3 years since last commit

21 users on Open Hub

Activity Not Available
4.71429
   
I Use This
Licenses: AGPL3, gpl3_or_l...

hashicorp/terraform

Compare

  Analyzed 1 day ago

Terraform is a tool for building, changing, and combining infrastructure safely and efficiently.

278K lines of code

172 current contributors

1 day since last commit

10 users on Open Hub

Very High Activity
4.5
   
I Use This
Licenses: No declared licenses

RGL

Compare

  Analyzed almost 3 years ago

RGL is a framework for graph datastructures and algorithms implemented in Ruby.

7.97K lines of code

0 current contributors

over 11 years since last commit

2 users on Open Hub

Activity Not Available
2.0
   
I Use This

CXXGraph

Compare

  Analyzed about 5 hours ago

Header-Only C++ Library for Graph Representation and Algorithms

8.78K lines of code

0 current contributors

about 2 months since last commit

1 users on Open Hub

Low Activity
5.0
 
I Use This

digraphtools

Compare

  Analyzed about 9 hours ago

Some tools for working with directed acyclic graphs, partial orders and topological sorting with Python

386 lines of code

0 current contributors

about 11 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

ModelGUI

Compare

  Analyzed over 1 year ago

ModelGUI (or simply mgui) is an open source Java-based project intended to provide a graphic user interface (GUI) for interactions between scientists (or enthusiasts) and their models. It offers 2D and 3D graphic rendering, database functionality, graph visualization, various geometric functions ... [More] , project management, and a pipeline execution framework. It is currently in the alpha (development) phase. [Less]

134K lines of code

0 current contributors

about 7 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

UnFlock

Compare

  Analyzed about 4 hours ago

Drag the birds around until no more lines intersect. Game made with Bevy engine. Available on https://centralgamingsystem.itch.io/unflock and https://central-gaming-system.gitlab.io/unflock/

2.6K lines of code

0 current contributors

7 months since last commit

1 users on Open Hub

Very Low Activity
0.0
 
I Use This

lnlc

Compare

  Analyzed over 1 year ago

lnlc calculates linear nlc-width and corresponding linear nlc-width expressions. On 2014's computers it works quite well up to graph sizes of about 10 nodes of linear nlc-width 3. The runtime depends on the size of the input graph, its linear nlc-width, and the number of nodes of high degree. ... [More] The archive also contains the widths and corresponding expressions for the trees of up to 12 nodes. [Less]

36.6K lines of code

0 current contributors

about 2 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This

fkt

Compare

  Analyzed about 6 hours ago

An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.

5.16K lines of code

0 current contributors

about 1 year since last commit

0 users on Open Hub

Very Low Activity
0.0
 
I Use This