Git/Download - KitwarePublic. Eigen. Downloads – LEMON – Trac. Cambridge University Engineering Department - Data Structures and C++ This document aims to provide enough background information to encourage you to write graph-related C++ code. First some Standard Containers are shown in action, and their use extended to deal with user-defined classes. Then some Tree and Graph concepts are introduced. Finally implementation ideas are given to help tackle some exercises, building on C++'s supplied containers.
Introduction to Standard Containers Many books exist dealing with sorting and organising data. Sequential - the order of the elements matter (e.g. vector)Associative - the order of the elements doesn't matter (e.g. set)Adapters - containers that are modifications of other containers (e.g. stack) These containers have many member functions in common. The Standard Library doesn't contain a tree container, but if you wrote one so that it had the standard hooks that algorithms require, then algorithms like copy etc. should work with it. Developing Containers Ways to extend the basic use of containers include Queues Trees.
Yagsbpl - A template-based C++ library for graph search and planning. Update (May, 2013): v2.1 released. Description: "Yet Another Graph-Search Based Planning Library (YAGSBPL)" is a fast, efficient and easy-to-use graph construction and search (using algorithms like A-star, Dijkstra's, etc.) library written in C++, designed specifically for searching medium to large scale graphs for optimal paths. Quick start: Download the latest library (v2.1): yagsbpl-v2.1.zip. Download the basic example programs and follow instructions in README file: yagsbpl-2.x_basic-examples.zip. Read the detailed documentation at YAGSBPL is designed to be: Fast (e.g., with integer coordinates for nodes but floating point cost as well as cost function needing to perform floating point operations online, and an average degree of the graph being 8, the library can expand about 70,000 nodes in the graph in just 1 second on a 2.1GHz processor machine with 2GB RAM.)
Basic code structure for the simplest usage: YAGSBPL supports: - Directed graphs with complex cost functions. Graphviz. The igraph library for complex network research. Open Graph Drawing Framework: start. Computational Infrastructure for Operations Research Home Page. GForge: CGAL: Project Filelist. Project Filelist Below is a list of all files of the project. The release you have chosen is highlighted. Before downloading, you may want to read Release Notes and ChangeLog (accessible by clicking on release version). CGAL 4.4-beta1 CGAL 4.3-beta1 CGAL 4.2-beta1 CGAL 4.1-beta1 CGAL 4.0-beta1 CGAL 3.9-beta1 CGAL 3.8-beta1 CGAL 3.7-beta1 CGAL 3.6-beta1 CGAL 3.5-beta1 CGAL 3.4-beta1.
LibreDWG. GNU LibreDWG is a free C library to handle DWG files. It aims to be a free replacement for the OpenDWG libraries. DWG is the native file format of AutoCAD. GNU LibreDWG is based on LibDWG, originally written by Felipe Castro. Downloading LibreDWG LibreDWG is in alpha development stage. Mailing lists and updates GNU LibreDWG has a development and general discussion mailing list: <libredwg@gnu.org>.
Announcements about LibreDWG are made on <info-libredwg@gnu.org>. To subscribe to these or any GNU mailing lists, please send an empty mail with a Subject: header of just subscribe to the relevant -request list. News are posted on the news section at Savannah. Getting involved Development of LibreDWG, and GNU in general, is a volunteer effort, and you can contribute. Development For development sources, bug and patch trackers, and other information, please see the LibreDWG project page at savannah.gnu.org. Maintainers Licensing.