murygin.wordpress.com
Neo4j and JGraphT – A Perfect Team | Open Your Code
https://murygin.wordpress.com/2015/06/25/neo4j-cypher-jgrapht
Homepage von Daniel Murygin. Neo4j and JGraphT – A Perfect Team. Is an open-source graph database, implemented in Java. JGraphT. Neo4j REST API provides a way to query the database with Cypher. Cypher is a declarative graph query language. See the Neo4j manual. To learn more about it. The project. Contains classes to query Neo4j using the REST API and to convert the JSON result to a JGraphT graph object. The code is an GitHub in repository jgrapht-neo4j-client. Which is implemented in JGraphT. Lt;depende...
fpt.akt.tu-berlin.de
Graphana 2.0
http://fpt.akt.tu-berlin.de/graphana
Graphana can be used to analyze the combinatorial structure of graphs. Given one or more input graph(s), Graphana computes or estimates the values and distributions of different graph parameters. Other things, that can be done with Graphana:. Graph instance creation (e.g. with random generators). The current version of Graphana is 2.0. The main window of the GUI. Example histogram of degree distribution. Executable .jar file. Ndash; the full Graphana program for analyzing graphs via basic commands.
net2plan.com
Net2Plan - The open-source network planner
http://www.net2plan.com/license.php
The open-source network planner. Installation guide, system requirements and starting Net2Plan. Net2Plan 0.4.1 User's guide. Net2Plan 0.4.1 API Javadoc. Net2Plan 0.4.1 Examples Javadoc. It is licensed under the GNU Lesser General Public License. Version 3 or later (the "LGPL"). Then, you can use Net2Plan or parts into your programs for free, can make money from them, and do not have to disclose your code. You are obliged to mention that you are using Net2Plan in your program. For helper utilities for the.
stevewedig.com
Digraphs, Dags, and Trees in Java | Steve Wedig's Notes
https://stevewedig.com/2014/10/06/digraphs-dags-and-trees-in-java
Steve Wedig's Notes. Digraphs, Dags, and Trees in Java. Are a collection of nodes connected by edges. Programmers run into graphs fairly regularly because almost any collection of things with binary relationships can be viewed as a graph. As practitioners we need to understand both graph theory. Abstract structures) and graph data structures. Three common families of graphs are:. Graphs with directed edges (arcs). Digraphs that don’t contain cycles. How can we recognize them? What can we do with them?
vlab.infotech.monash.edu.au
The Complexity Project (VLab: Virtual Complexity Lab)
http://vlab.infotech.monash.edu.au/resources/the-complexity-project
Virtual Complexity Lab at Monash University. The Complexity Project is a free Java library for implementing Graph and Cellular Automata objects, algorithms and simulation. It provides an extensible language for modeling and visualisation of data that can be represented as a network or Cellular Automata structures. Supports directed and undirected graphs of various topologies: random, small-world, tree and scale-free. Supports 2D cellular automata of rectangle and torus structures.
client2server.com
Crosswire Digital Media » home
http://www.client2server.com/doku.php/home
Java Rest Api Documentation. That has become a popular extension in other frameworks. Dart and Web Applications. Note you can now load dependencies with http:/ www.webjars.org/. Engines including Jade, handlebars. Inc bower (dependency), grunt (build tools). Mobile/Web framework inconic, angualarjs. Data sync-ing nodejs app. See also erpnext.com . that works on MariaDb. Map of the emerging db's. List of database proxy drivers. Http:/ db.apache.org/derby/integrate/db ddlutils.html. Heruko - $35 a month.
SOCIAL ENGAGEMENT