发明名称 |
Method of Determining Minimum Cost Path |
摘要 |
A network is represented using a graph. The graph comprises a plurality of vertices and a plurality of edges. The vertices comprise a source vertex, a destination vertex and a vertex u. The edges link corresponding adjacent pairs of the vertices. A minimum cost path in the graph is determined from the source vertex to the destination vertex, wherein the vertex u is in the minimum cost path. An edge from the vertex u in the minimum cost path introduces an additional capital expenditure cost that is dependent on how the minimum cost path traverses from the source vertex to the vertex u.
|
申请公布号 |
US2009132989(A1) |
申请公布日期 |
2009.05.21 |
申请号 |
US20070940842 |
申请日期 |
2007.11.15 |
申请人 |
AT&T KNOWLEDGE VENTURES, LP |
发明人 |
OU CANHUI;LI JIAN;GEMELOS STEVEN;MOUNTFORD HOWARD SCOTT;JACOBSON BRENT EDWARD;ECHEVERRIA-CALVET ORLANDO;CRONIN THOMAS;OSATO JEROLD DAIZO |
分类号 |
G06F17/50 |
主分类号 |
G06F17/50 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|