Search Results for "graph c#" - Page 3

ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina

https://github.com/jplevyak/ifa IFA, Iterative Flow Analysis is a combined data-flow and control flow analysis. It is capable of resolving the concrete types (as opposed to the nominal or declared types) and the interprocedural call graph for statically or dynamically typed programs.

Jlint will check your Java code and find bugs, inconsistencies and synchronization problems by doing data flow analysis on the code and building the lock graph. Jlint is fast, easy to learn, and requires no changes in the class files to be checked.

... graph metrics, and represent its structure. S-BITE is mostly implemented in C and depends on the igraph library available at http://igraph.sourceforge.net In order to speed up the execution of the different components, the package uses shell scripts.

LGL is a compendium of applications for making the visualization of large networks and trees tractable. LGL was specifically motivated by the need to make the visualization and exploration of large biological networks more accessible.

... to find its way until it reaches the (0,x) point. In version 1.0.0, we have limitations; - We're in 2 dimensional world, meaning we have only x and y axis. - We have a one-way graph. There's only one solution to find the way from the starting point to the (0,x) point. Future versions will include 3 dimensional space and will include more complex mazes with many solutions. Arda Ulas UNLU ardaulas@hotmail.com

The Network-Integrated Multimedia Middleware (NMM) is a flow graph based multimedia framework that allows to create distributed multimedia applications: local and remote multimedia devices or software components can be combined.

NOTE: This project was moved to: https://github.com/eetorres An easy scientific data visualization widget for the FLTK library. The widget is an OpenGL based contour visualizer for Linux, which allow you to built 2D and 3D graph of contour and colour map for a xy regular or scattered data set. There is a good example with the topographic data of Poland with 5902 data points to introduce yourself how to use it. There is not much documentation but it is easy to use. The input data are in XYZ...

CoFlo generates Control-Flow Graphs from C and C++ source code. It can then output the graphs in a number of ways and perform various control flow analyses. NOTE: CoFlo has not been under active development for several years. At this time, I suggest you look into LLVM-based tooling to see if there is anything similar to CoFlo which will meet your needs.

KCachegrind visualizes traces generated by profiling, including a tree map and a call graph visualization of the calls happening. It's designed to be fast for very large programs like KDE applications.

OGDL is a structured format for representing graphs of information, alternative to XML. Its grammar is very simple allowing for compact parsers. The text version is easily readable; the binary version is used for storage and interprocess communication.

New Homepage: http://wummel.github.io/linkchecker/ Linkchecker features: - recursive and multithreaded checking and site crawling - output in colored or normal text, HTML, SQL, CSV, XML or a sitemap graph in different formats - HTTP/1.1, HTTPS, FTP, mailto:, news:, nntp:, Telnet and local file links support - restrict link checking with regular expression filters for URLs - proxy support - username...

The Firm library implements the Firm intermediate representation (ir), a graph based SSA intermediate represenation for compilers.

cZUI is a Zoomable User Interface framework, allowing the creation of zoomable interfaces in C++. It uses the scene graph concept, with the possibility of panning and zooming cameras on various parts of the scene. Multiple cameras can be painted on the same window, each with its own painting rectangle. Multiple demos and a tutorial are available.

flow is a cross-platform headers-only C++11 framework which provides the building blocks for streaming data packets through a graph of data-transforming nodes

FunctionCheck is a profiler for C/C++ programs, based on gcc V4.6.3+. Features are flat profile, cycles detection, call-graph, MIN/MAX time in functions, memory profiling, profiling control at execution...

QFlow is a dataflow framework written in Qt which allows interaction of QObjects in a dataflow graphs. Such a workflow can contain graphical modules(QWidgets) which would be displayed during the execution of graph and can interact with other QObjects. Framework consists of Designer and multiple plugins with modules.

**Beta version binaries are up:** *Windows:* Just unpack the archive and run the exe. *Linux:* Download and run the binary. If it doesn't run, execute "chmod +x wxArithmetic_32bit_linuxTestBinary" and run again. Trouble getting your mind up to speed in the morning? Does every morning at the office seem like monday morning? Calculate 100 arithmetic operations in the morning to warm up for the day. wxArithmetic is a simple arithmetic practice game. It generates random operations and...

SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.

This software is to be used as a communication interface for photographic densitometers to receive transmission or reflective density through the serial port RS-232. A graph of the received data is also done automatically.

A project to create of open source routing engine for navigation and possibly other graph analysis. Our goal is to build a commercial grade routing engine capable of find routes through 25-30 million node networks in 1 second ball park times.

The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.

Open Source Routing Machine computes shortest paths in a graph. It was designed to run well with map data from the Openstreetmap Project.

This is a C++ library to create and simulate standard and hybrid bond graph. The library support XML input and output of the bond graph structure. Graphic representation of the bond graph in SVG are generated using the Graphviz library.