Search Results for "graph algorithm"

Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of...

PLEASE NOTE: There is a complete installer available if you do not have CVI installed. If you do have it, you can simply download the source files and run them. The following program was built as a final evaluation project for Programming for Mechatronics Course for my BSc. in Mechanical Engineering. This solver is based around the Gauss-Seidel algorithm for 2D heat transfer for pre-determined boundary conditions (i.e. user defined temperatures). I hope this project will be useful...

directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph

... that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w. Their performance is better than GNU implementation

PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.

The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers

An algorithm to compute molecular graph descriptors considering the stereochemistry of the molecular structure, based on our previously introduced signature molecular descriptor. The algorithm can generate two types of descriptors, one which is compliant with the Cahn-Ingold-Prelog priority rules, and a faster one based on our previous definition of a directed acyclic graph that isaugmented to a chiral molecular graph.

A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.

The implementations of finding the k shortest paths (KSP) algorithm. A C/C++ library including some classical graph relative algorithm implementations.