산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)
- 제18권36호
- /
- Pages.153-158
- /
- 1995
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
General networks 에 있어서 최단 경로 문제에 대한 연구
A Study on the Shortest Path Problem in General Networks
초록
Finding shortest paths in networks is the fundamental problem in network theory and has numerous in Operations Research and related fields. The purpose of this study is to present a algorithm for solving the length of the shortest paths from a fixed node in a general network in which the arc distance can be arbitrary value. This algorithm has a worst computational bound of
키워드