There are packages like, Combinatorica in Mathematica, GA, SA, PSO can be comparatively easily done in MATLAB, C++ has boost, Java has JGraphT and so on and on. My question 'Is there any Graph theory package that have almost all the tools, GA, SA, PSOis, Ant Colony Optimization and such I need?'
- How do Graph Theorists carry out large computational experiments?
- What languages or packages or libraries do they usually use? Is their any general preferences?
- Do they use a combination of many sporadic resources? Like use something that is good at plotting, then use some other thing that is good for numerical solutions etc?
- Where from you get Hard-Instances ?
Background: I'm assigned to work on a GT problem named 'Degree Constrained Minimum Spanning Tree'. I want to study, implement and compare current algorithms. As I've been studying, I come to observe most of the algorithms are : Heuristics, Distributed Algorithms, Genetic Algorithms, Linear Programming (Narula-Ho) etc. Some uses methods called 'Particle Swarm Optimization', 'Simulated Annealing' and 'Ant Colony Optimization'. As far as I know MATLAB has built in routines for GA, SA, PSO, ACO etc but don't have any graph theory package. Combinatorica seems very good package but I don't have any access to it's accompanying book 'Computational Discrete Mathematics'. I don't know MATLAB or Mathematica.
Update: A comprehensive list on GT packages/systems can be found here: http://wiki.sagemath.org/graph_survey
Update It seems Mathematica 7 has all the above, mostly as built in functions/Commands.