Perhitungan lintasan terpendek multiterminal jaringan grafh berarah dengan algoritma matriks dan algoritma floydrschql

Abstract

ABSTRAK Perhitungan lintasan terpendek dari setiap pasang titik (lintasan terpendek multiterminal) i dan j dalam jaringan graph G dapat menggunakan Algoritma Matriks dan Algoritma Floyd-Warshall. Kedua buah algoritma tersebut dapat digunakan pada setiap jaringan graph berarah G(V,E,1) yang mempunyai bobot positif, negatif maupun nol. Namun tidak berlaku untuk jaringan graph berarah yang terdiri dari sirkuit negatif. ABSTRACT Calculating all the shortest directed path between all pairs of nodes in a net G can be presented two algorithms are called by Matrix Algorithm and Floyd Warshall Algorithm. Both of algorithms can be used for directed graph G(V,E,1) was consists of positive, negative or zero of length l(i,j) of the arcs. Both of algorithms can't used in any net with contain any negative directed circuit. The length of a directed circuit is negative was consists of a negative directed