| Aaron | hello | 07:55 |
|---|---|---|
| Aaron | ll | 07:59 |
| === Nicke_ is now known as Nicke | ||
| ludovicc | hello, any meeting today? | 14:03 |
| ttx | ludovicc: in progress in #ubuntu-meeting | 14:08 |
| ttx | ludovicc: come, quick :) | 14:08 |
| ttx | <-- Thierry here | 14:08 |
| ludovicc | ;-) | 14:09 |
| ludovicc | tx | 14:09 |
| lordwicho | hi | 22:44 |
| lordwicho | I have a problem with backtracking, can someone help me | 22:46 |
| lordwicho | ? | 22:47 |
| lordwicho | I have to solve this problem and no where to initiate | 22:50 |
| lordwicho | say the problem.. | 22:54 |
| lordwicho | a dealer wants to make its way in the best possible way, this has a set of sites you must deliver any package and the distance to be traveled from one place to another. must deliver all packages and indicate which was the shortest route | 22:54 |
| maxb | Err... isn't that the classic "Travelling Salesman" problem, which has been proven impossible to solve for the absolute shortest route in the general case? | 23:24 |
| maxb | erm, impossible to solve without checking every possible route, I mean | 23:25 |
Generated by irclog2html.py 2.7 by Marius Gedminas - find it at mg.pov.lt!