Algoritma untuk Dekomposisi Digraf Terboboti dengan Aplikasi Analisis Siklus Kehidupan Dipsacus sylvestris

Abstract

Life cycle analysis is often carried out by ecologists. Life cycle can be described by digraph (directed graph), which consists of nodes as the stages of life cycle and the edges as the contribution of one life stage to another life stage. Further, the digraph was analyzed using algorithmic graph theory. This approach is done by decomposing weighted digraph by determining the cycle and then remove the edge with the smallest weight in the cycle. This digraph consist of two parts. The first part contains cycles that do not contain contradictory directions. The second contains no cycle. This algorithm ensures that the resulting cycle does not lead the contrary, when applied to the analysis of the life cycle.