本文介绍了ThoughtWorks的一道笔试题——Trains问题，涉及使用C++编程计算有向图中城镇之间的特定路线距离、不同路线数量、最短路线长度等。并给出了测试输入和预期输出。
本文内容转自互联网（百度文库）
Problem one: Trains
Thelocal commuter railroad services a number of towns in Kiwiland. Because ofmonetary concerns, all of the tracks are 'one-way.' That is, a route fromKaitaia to Invercargill does not imply the existence of a route fromInvercargill to Kaitaia. In fact, even if both of these routes do happen toexist, they are distinct and are not necessarily the same distance!
Thepurpose of this problem is to help the railroad provide its customers withinformation about the routes. In particular, you will compute the distancealong a certain route, the number of different routes between two t
最低0.47元/天 解锁文章
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
