You were probably disappointed by calculating shortest path using Floyd-Warshall with perl. It took me several minutes to fix the code, even if I do not use the Graph module at all - I just read the documentation, installed the module and tried several changes. The algorithm remained the same, the only difference was the method name and argument order.