登入選單

返回Google圖書搜尋

All Shortest Routes in a Graph

Stanford University. Department of Operations Research. Operations Research HouseGeorge B. Dantzig

出版	Operations Research House, Stanford University, 1966
URL	http://books.google.com.hk/books?id=udEEAAAAIAAJ&hl=&source=gbs_api

註釋

An inductive procedure on nodes is given that requires n(n-1)(n-2) comparison - addition operations to determine minimum routes between all nodes of a directed network. Arc distances may be negative. If negative cycles exist, however, termination will occur when one such is found. (Author).