发明申请
US20070263544A1 System and method for finding shortest paths between nodes included in a network
审中-公开
用于查找网络中包含的节点之间的最短路径的系统和方法
- 专利标题: System and method for finding shortest paths between nodes included in a network
- 专利标题(中): 用于查找网络中包含的节点之间的最短路径的系统和方法
-
申请号: US11603995申请日: 2006-11-21
-
公开(公告)号: US20070263544A1公开(公告)日: 2007-11-15
- 发明人: Naoaki Yamanaka , Hiroyuki Ishikawa , Yutaka Arakawa , Sho Shimizu , Kosuke Shiba
- 申请人: Naoaki Yamanaka , Hiroyuki Ishikawa , Yutaka Arakawa , Sho Shimizu , Kosuke Shiba
- 申请人地址: JP Tokyo JP Tokyo
- 专利权人: IPFLEX INC.,KEIO UNIVERSITY
- 当前专利权人: IPFLEX INC.,KEIO UNIVERSITY
- 当前专利权人地址: JP Tokyo JP Tokyo
- 优先权: JP2006-134639 20060515
- 主分类号: G08C15/00
- IPC分类号: G08C15/00
摘要:
There is provided a system that uses a network matrix to carry out a search for shortest paths from a starting node included in a network having a plurality of nodes to other nodes. The network matrix includes link costs of links and each link has a root end that is a node included in the network and a tail end that is another node connected to the root end. The system includes a processor that includes a circuit for subtracting a lowest value from link costs of the subject links being searched that are included in the network matrix, a circuit for setting tail end node of a link out of the subject links whose link cost has become zero due to the subtracting as a reached node, a circuit for changing link costs of links included in the network matrix whose tail end nodes are the reached node to a value indicating exclusion from further search, and a circuit for setting values after the subtracting of link costs of the subject links whose link costs do not become zero due to the subtracting as link costs of links for a continued search.
信息查询