abhishekmunie

//
//  main.cpp
//  FloydGreedyTravel
//
//  The program tries to find a path to visit all vertices of Graph.
//  The rules are:
//  * Nodes can be visited more than once.
//  * Try to find shortest path
//
//  First it find All-Pairs Shortest Paths using The Floyd-Warshall algorithm.

paulirish

// http://paulirish.com/2011/requestanimationframe-for-smart-animating/
// http://my.opera.com/emoller/blog/2011/12/20/requestanimationframe-for-smart-er-animating

// requestAnimationFrame polyfill by Erik Möller. fixes from Paul Irish and Tino Zijdel

// MIT license

(function() {
    var lastTime = 0;
    var vendors = ['ms', 'moz', 'webkit', 'o'];