JUNG: Java Universal Network/Graph Framework

  •        347

JUNG is a software library that provides a common and extensible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. Its basis in Java allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries.

https://github.com/jrtom/jung
http://code.google.com/p/jung
https://sourceforge.net/projects/jung/

Tags
Implementation
License
Platform

   




Related Projects

jGraphT - Java graph library


JGraphT is a Java graph library that provides mathematical graph-theory objects and algorithms. It includes directed, undirected, weighted, unweighted etc. Graphs could be created based on Strings, URLs, XML documents.

Java Universal Network/Graph Framework


JUNG provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network.

cytoscape


Cytoscape.js is a fully featured graph theory library. Do you need to model and/or visualise relational data, like biological data or social networks? If so, Cytoscape.js is just what you need. Cytoscape.js contains a graph theory model and an optional renderer to display interactive graphs. This library was designed to make it as easy as possible for programmers and scientists to use graph theory in their apps, whether it's for server-side analysis in a Node.js app or for a rich user interface.

graph - A mathematical graph/network library written in PHP


This library is built around the concept of mathematical graph theory (i.e. it is not a charting library for drawing a graph of a function). In essence, a graph is a set of nodes with any number of connections in between. In graph theory, vertices (plural of vertex) are an abstract representation of these nodes, while connections are represented as edges. Edges may be either undirected ("two-way") or directed ("one-way", aka di-edges, arcs). Depending on how the edges are constructed, the whole graph can either be undirected, can be a directed graph (aka digraph) or be a mixed graph. Edges are also allowed to form loops (i.e. an edge from vertex A pointing to vertex A again). Also, multiple edges from vertex A to vertex B are supported as well (aka parallel edges), effectively forming a multigraph (aka pseudograph). And of course, any combination thereof is supported as well. While many authors try to differentiate between these core concepts, this library tries hard to not impose any artificial limitations or assumptions on your graphs.

Simple Dot Net Grapher


Demo project for drawing graphs based on a equation E.g F(x) = 5x^2 + 10x - 1 Just a math grapher I made to test the DynamicDataDisplay library and dynamic string evaluation


WPFGraph


WPFGraph is a tool to create animations of graph algorithms using a WPF based 3D rendering engine. You can create a graph by adding nodes and edges to the UI simply by using your mouse. Then you can execute a graph algorithm like Dijkstra on the created graph.

networkx - Official NetworkX source code repository.


NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. For additional details, please see INSTALL.rst.

.Net Neo4j Rest Client


Neo4jRestSharp is a .Net client for the Neo4j Rest Server. Neo4j is an open sourced java based transactional graph database that stores data structured in graphs rather than in tables.

.NET Graph Library


The .Net Graph Library makes it easy for developers to create, traverse, analyze and solve problems related to graphs.

alga - Algebraic graphs


Alga is a library for algebraic construction and manipulation of graphs in Haskell. See this paper for the motivation behind the library, the underlying theory and implementation details. This algebraic structure corresponds to unlabelled directed graphs: every expression represents a graph, and every graph can be represented by an expression. Other types of graphs (e.g. undirected) can be obtained by modifying the above set of laws. Algebraic graphs provide a convenient, safe and powerful interface for working with graphs in Haskell, and allow the application of equational reasoning for proving the correctness of graph algorithms.

Dependency Analyzer


Dependency Analyzer is a utility for visualizing Maven2 dependency graphs. It is using Maven for resolving dependencies and the Java Universal Network/Graph Framework (JUNG) for visualizing the dependency graph. Spring rich client is used for building th

Mondrian - A static php code analysis tool using the Graph Theory


A static php code analysis tool using the Graph Theory

category-theory-programmers - Notes on category theory in the context of (functional) programming


This document contains notes on category theory in the context of (functional) programming. Originally they were lecture notes for a seminar hosted at Centrum Wiskunde & Informatica, the national research centre for mathematics and computer science in the Netherlands. The main reason for compiling these notes is to provide a way to gain familiarity with concepts of category theory (and other branches of mathematics) that apply in a broad sense to the field of functional programming. The notes are written in Markdown, and pandoc is used to generate the document. Running make inside the doc directory should result in an (updated) pdf, granted that pandoc, pandoc-citeproc and a LaTeX environment are installed.

RoxGT - Eclipse Graph Theory Framework


RoxGT its an open source framework for building Graph-based applications. It has been built essentially for academic jobs, such as graph algorithm execution and theorem proofs.

Graph I and R Libraries


The Graph Implementation and Representation Libraries, or GIRLs, aim to be all-purpose libraries for solving graph theory problems. ie, shortest paths, matching, cycles, connectedness, creating 'random' graphs, etc...

Commons Math: The Apache Commons Mathematics Library


Commons Math is a library of lightweight, self-contained mathematics and statistics components addressing the most common problems not available in the Java programming language. it has support for Linear Algebra, Probability Distributions, Numerical Algebra, Statistics, Transform methods, Least Square etc.

G.A.V.


G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.

GraphEngine - Microsoft Graph Engine


Microsoft Graph Engine is a distributed in-memory data processing engine, underpinned by a strongly-typed in-memory key-value store and a general distributed computation engine.This repository contains the source code of Graph Engine and its graph query language -- Language Integrated Knowledge Query (LIKQ). LIKQ is a versatile graph query language on top of Graph Engine. It combines the capability of fast graph exploration and the flexibility of lambda expression: server-side computations can be expressed in lambda expressions, embedded in LIKQ, and executed on the server side during graph traversal. LIKQ is powering Academic Graph Search API, which is part of Microsoft Cognitive Services.

Gremlin - Graph Traversal Language


Gremlin is a graph traversal language. Gremlin works over those graph databases or frameworks that implement the Blueprints property graph data model. It works beter with graph database like TinkerGraph, Neo4j, OrientDB, DEX, Rexster, and Sail RDF Stores. This language has application in the areas of graph query, analysis, and manipulation.