TRAIL EULER MINIMAL DI DALAM GRAF BERARAH YANG TERBOBOTI

Siti Julaeha (Dosen Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung)
Murtiningrum Murtiningrum (Mahasiswa Program Magister Matematika, Departemen Matematika FMIPA Universitas Indonesia)
Rida Novrida (Guru SMAN 11 Kota Jambi)
Endang Retno Nugroho (Dosen Universitas Nasional Jakarta)

JURNAL ISTEK
Vol 5, No 1-2 (2011): ISTEK

Suppose G is a Eulerian directed graph with an edge labeling. In this paper will discuss the literature studies an algorithm to construct Euler trail that starts at a node r with the lexicographic minimum label among all Euler trail that starts node r is.