A Study on the Shortest Path Problem in General Networks

General networks 에 있어서 최단 경로 문제에 대한 연구

  • 김준홍 (수원대학교 산업공학과)
  • Published : 1995.12.01

Abstract

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 $n^3/4$ additions and $n^3/4$ comparisons, which is lower the worst computational bounds of other available algorithms.

Keywords