The purpose of this paper is to identify cycles, and in particular positive cycle(s), in an activity network under generalized precedence relations (GPRs). An algorithm is provided to search for such cycle(s). An impr...The purpose of this paper is to identify cycles, and in particular positive cycle(s), in an activity network under generalized precedence relations (GPRs). An algorithm is provided to search for such cycle(s). An improved depth-first search is adopted. An efficient arc-oriented representation is used in the algorithm to save on computer storage requirement.展开更多
文摘The purpose of this paper is to identify cycles, and in particular positive cycle(s), in an activity network under generalized precedence relations (GPRs). An algorithm is provided to search for such cycle(s). An improved depth-first search is adopted. An efficient arc-oriented representation is used in the algorithm to save on computer storage requirement.
