Search Results for "live-graph"

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs).

WordMat is an add-on to Microsoft Word which creates a tab with math functionality. Part of the Math functionality is provided by other open-source applications like Maxima, GeoGebra, Graph and GnuPlot.

Carassius is a tool for editing of Petri nets and graphs. It allows to create and edit models in a very simple manner. Carassius has features for model arrangements and formatting, thus it makes a model more readable and demonstrative. With Carassius one can simply construct the model and export automatically generated TeX-code for the paper. Suitable markup languages: PNML and graphML. System reqs: MS Windows and .NET Framework 4.0 or higher. Carassius is made in HSE PAIS Lab.

Equation Untie is an equation solver that enables you to solve and graph mathematical equations of the first and second degree in both real and complex planes.

An interactive graph plotting control written in C#

A small app that demonstrates the decomposition of a complete graph into triangles using Bose and Skolem constructions of Steiner triple systems.

yagdt (Yet Another Graph Drawing Tool) is a plugin-based graph drawing application & distributed graph storage engine.

A .NET implementation of the Gabow, Kaplan, Tarjan algorithm for testing the uniqueness of a perfect matching in a general graph.

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G