Projects tagged ‘graph’ and ‘graphviz’

phpCallGraph is a tool to generate static call graphs for PHP source code. Such a graph visualizes the call dependencies among methods or functions of an application. Arrows represent calls from one ... [More] method to another method. Classes are drawn as rectangles containing the respective methods. The graphs can be leveraged to gain a better understanding of large PHP applications or even to debunk design flaws in them. The core of the call graph generator forms an object-oriented PHP5 library, which may also be integrated in other projects. It leverages the InstantSVC CodeAnalyzer and DOT. On top of it, a commandline application allows easy creation of call graphs in various formats, e.g. text, png, jpg or svg. phpCallGraph is free software licensed under GPLv3. [Less]

GNOWSYS, Gnowledge Networking and Organizing System, is a web based hybrid gnowledge base with a kernel for semantic computing. It is developed in Python and works as an installed product in ZOPE.

A fluent interface for .NET for generating graphs with GraphViz.

graph-tool is a python module to help with statistical analysis of graphs. Its feature set includes support for both directed and undirected graphs with arbitrary vertex and edge properties ... [More] , edge/vertex filtering, correlated random graph generation and community detection. It supports also several statistical measurements, such as: degree histogram, combined degree histogram, vertex-vertex degree correlation, average nearest neighbours degree, vertex-edge-vertex correlation, clustering coefficients, extended clustering coefficient, assortativity coefficient, betweenness centrality, average distance, component statistics and reciprocity. The core algorithms are written in C++, making use of the Boost Graph Library, and template metaprogramming techniques, with performance in mind. [Less]

A Java binding for Grahphviz built on top of the existing SWIG-generated api. This provides a more flexible object-oriented interface to the graph model, and support for rendering the generated graphs using GEF/draw2d.

Libgann is a artificial neural network library implemented in C++.

Lines and Dots (LAD) is an application for exploring graph theory and networks. It is written in Python and available on many platforms, including Windows, Mac, and Linux. LAD provides editable ... [More] lists of Python elements and an interactive Python shell that allows for programmatic manipulation of both the graph and the program itself. It is very easy to extend the program by creating your own Python module and importing it. [Less]

VEGAVEGA is both a program for visualizing algorithms, as well as a library of Graph classes that can aid the programmer in the development of their own algorithms. LibraryThe VEGA library is ... [More] currently under development, but so far has a large set of base classes to work with. The code utilizes the Java Generics framework which allows for compile-time type checking, so as to prevent class cast errors. This is not a requirement for the developer, but is highly recommended. The code consists of a series of base classes that can be used to construct more complicated structures. All forms of Graphs, whether they be Trees or Networks, extend the base Abstract Graph class, which utilizes the Graph interface also included in the code. It should be noted that almost every class included in VEGA has a corresponding interface that allows for custom development of classes to meet specific requirements and expectations. VEGA ApplicationThe VEGA Application is a tool that is meant to help users see how an algorithm or data-structure works by visually representing it using Graphviz. The reasoning behind the development of the application is that it is far easier to understand how something works when one moves beyond abstract mathematical notation and is able to see working demos. VEGA has been developed such that it is not able to just represent a handful of algorithms and data-structures, but rather any algorithm or data-structure that adheres to some basic conventions. By implementing some basic methods, a user is able to take existing code of an algorithm or data-structure and output the necessary information to VEGA for representation. Current Algorithms and Data StructuresWe currently have implemented a handful of algorithms and data structures, and more are on the way. As of July 10, 2008, we have the following: Fibonacci Heaps Red Black Trees Dijkstra's Algorithm 2-OPT (TSP Algorithm) Nearest Neighbor Algorithm Heap sort Binary Search Tree Prim's Algorithm We anticipate having Thin and Thick heaps implemented by the end of summer 2008. [Less]

GraphViz binding for Io language.

Coordinated Graph Visualization