Search Results for "graph coloring"

Emerge (or emerge-viz) is an interactive code analysis tool to gather insights about source code structure, metrics, dependencies, and complexity of software projects. You can scan the source code of a project, calculate metric results and statistics, generate an interactive web app with graph structures (e.g. a dependency graph or a filesystem graph), and export the results in some file formats. Emerge currently has parsing support for the following languages: C, C++, Groovy, Java, JavaScript, TypeScript, Kotlin, ObjC, Ruby, Swift, Python, and Go. The structure, coloring, and clustering is calculated and based on the idea of combining a force-directed graph simulation and Louvain modularity. emerge is mainly written in Python 3 and is tested on macOS, Linux, and modern web browsers (i.e., the latest Safari, Chrome, Firefox, and Edge).

...Сurrent version ( v. 9.1.1.395B): Examples for Delphi, Lazarus , GCC (Codeblock), MSVC. Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring , graph plotting & finding roots F(x), Fourier series. Old version (v.8.4.17.250): Examples for Delphi, FPC, Builder, MSVC , GCC (Codeblock) , VB6, FreeBasic. Download files: Foreval_all.7z (Foreval v9 + Foreval v8 + ForevalZ + all examples + doc) - recommend ForevalG9.7z (Foreval v9 + examples v9+ doc) (math parser, math expression parser, evaluate formula, evaluator, symbolic, differentiation, derivative , complex)

...Classes can be connected with all sorts of relations (Associations, Compositions, Generalization, etc.), objects with object relations. Following additional functionality is provided: Attributes, Mulitplicities, Roles, Object Graph Mode, Coloring, Save and Load, XMI 1.1 Import from Enterprise Architect, Associations (undirected, directed, bidirected), Aggregations, Compositions, Dependency, Generalization, Multiple Virtual Inheritance (Developer Addendum: It shouldn't be too difficult to add an API for remote application control, e.g. visualize and debug a running programm. ...

...Some most important planned features: * deep zooming capability (similar to Fractint) * multithreaded rendering * rendering divided to various machines ("rendering cluster") * various coloring modes * blending and filtering (based on a common graph, not on simple layers) * central database for storing and retrieving rendering parameters

IGV allows you to easily create and edit a graph, automatically places the graph on the plane (!!!), search for the minimal path (+coloring vertices), search center (+coloring), search vertices degree, search vertices eccentricity and others.

ksudoku is a fully-featured Sudoku puzzle generator and solver for KDE. With it you can generate and play 3D and 2D puzzles of different sizes and levels. The main algorithm is fast and extendable to any general graph coloring problem.

AgCSP is a CSP solver which use Evolutionary methodes. It is composed of a extendable library, parrallele executable and graphical interface. The CSP can be graph coloring, TSP, or anything else.