Search Results for "graph algorithms"

DiagrammeR is an R package to create, manipulate, and visualize network graphs, flowcharts, diagrams, and more using Graphviz and Mermaid syntax. Integrates with RMarkdown and Shiny apps, supports node/edge traversal, and graph analysis algorithms, making it ideal for documenting processes, causal relationships, or data pipelines.

Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each...

WingSegment is a MATLAB app-designed tool employing a hybrid approach of computer vision and graph theory for precise insect wing image segmentation. WingSegment detects cells, junctions, Pterostigma, and venation patterns, measuring geometric features and generating Voronoi patterns. The tool utilizes region-growing, thinning, and Dijkstra's algorithms for boundary detection, junction identification, and vein path extraction.

The Chemistry Development Kit (CDK) is a scientific, LGPL-ed library for bio- and cheminformatics and computational chemistry written in Java. The main home page of the CDK is now at: http://cdk.github.io

Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library.

Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).

vizceral is a component for displaying traffic data on a webgl canvas. If a graph of nodes and edges with data about traffic volume is provided, it will render a traffic graph animating the connection volume between nodes. This component can take multiple traffic graphs and will generate a 'global' graph showing all incoming traffic into each of the 'regions', with support for cross-region traffic. There are three levels of information, global, regional, and service-level, with clicking or...

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.

callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.

Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec

A Java software for 3D visualization of graphs/networks. It implements many graph layout algorithms (such as force-directed methods), graph generators (such as scale-free networks) and graph modifiers. Most functions can be accessed through its GUI.