Hello, I've made a python script that looks at the Transperth timetables and makes an adjacency file, similar to buildrandomtimetables.c, which I can then plug into assignports.sh. I've come across a problem where station A has a hop that goes to station B, but station B does not have any return hops. My group's protocol assumes that if you can go from A to B, you can also go from B to A, and so A and B are neighbours of each other. This is the true in buildrandomtimetables.c, but it's not true in Transperth's timetables. For example, Leederville_Stn has a single hop to Perth_Stn, but Perth_Stn has no hops back to Leederville_Stn. This is a contradiction of our assumption, and means that Leederville_Stn can send data to Perth_Stn, but Perth_Stn cannot send data to Leederville_Stn (as per the rules). So, should I change my python script to account for this case, by making both stations adjacent even if there's only a one-way hop, or is it intentional? Thanks

ANONYMOUS wrote: No, it's not intentional, just something that I hadn't spotted. ...still thinking on this one, with the goal of not making the project any more difficult (in terms of networking) than intended.