Ryan T Nerd
bristol.developer.ryan at gmail.com
Tue Jul 30 11:32:00 BST 2013
This is excellent, thank you. I love the gromits, they really do look so cool (my favourite so far is Buzz Lightyear gromit) so this is very welcome! On 30 July 2013 11:09, Matt Hamilton <matth at netsight.co.uk> wrote: > > On 30 Jul 2013, at 11:07, Matt Hamilton wrote: > > > > > On 30 Jul 2013, at 10:41, Thomas Buckley-Houston wrote: > > > >> So there's actually a handy > >> JSON file of the gromit data now if anybody wants to do anything else > >> interesting: http://instagromit.tombh.co.uk/gromits.json > > > > Awesome! So now I just need to cast my mind back to Uni days and try and > remember how Dijkstra's shortest path algorithm works :) > > > Hrmm… just thought…. Dijkstra didn't have to deal with push chairs and > Park st ;) So need to calculate the gradient between each point and factor > that in to the cost between each node…. hrm can it deal with costs being > different in different directions between two nodes…. > > -Matt > > -- > Matt Hamilton, Technical Director > Netsight Internet Solutions Limited > http://www.netsight.co.uk/matth > Tel: 0117 90 90 90 1 Ext. 13 > > Registered in England No. 3892180 > Registered office: 40 Berkeley Square, Clifton, Bristol, BS8 1HU > > > -- > underscore_ list info/archive -> > http://www.under-score.org.uk/mailman/listinfo/underscore > -- No spam, no recruitment agencies please. Java dev with a fairly full plate, so not really looking for any freelance work either.