On a given network, notonly the number of path-identifying stations and its position but also the number of total schemes of the path-identifying stations is calculated.
在给定的网络中，通过添加标识站对两顶点之间K最短路径识别，本文既给出标识站的数目、位置的确定方法，又给出了整个网络中添加标识站的总方案数的计算方法。
参考来源 - 网络的K最短路分析与应用In accordance with the prop tree diagram theory, adding the marking stations, the path-marking model in accurate way changes he annular structure speedway network into the tree structure.
准确路径识别模型是指依据图的支撑树理论，添加标识站，把环形路网结构变为树状结构的模型。
参考来源 - 高速公路联网收费模型、算法和应用·2,447,543篇论文数据，部分数据来源于NoteExpress
准确路径识别模型是指依据图的支撑树理论，添加标识站，把环形路网结构变为树状结构的模型。
In accordance with the prop tree diagram theory, adding the marking stations, the path-marking model in accurate way changes he annular structure speedway network into the tree structure.
最后，描述了一个联网收费区域标识站辅助规划的实用方案，可以减轻联网区域费率规划过程中的困难。
Finally, an assisting token station layout programming scheme is presented as well to help program the toll rate in the interconnected speedways area.
例如，您可以根据客户状态路由消息，即使入站消息只包含客户标识符。
For example, you could route a message based on customer status even if the inbound message contained only the customer identifier.
应用推荐