期刊名称：Faculty of Computer Science and Information Technology
出版年度：2010
卷号：0
期号：0
语种：English
出版社：Faculty of Computer Science and Information Technology
摘要：Graph can be imagined as a collection of objects or activities as an example isthe journey of a shipment of goods from one city to another, in the graph theorythis is better known as the traveling salesman problem (shortest path problem)that, in principle, find the shortest path from all the places that must be met sothey can save time, effort and cost. Completion of this shortest path problem canbe used many ways one of them is with a greedy method. Using this method wecan quickly find out what channels can be skipped so that the distance traversedby a minimum and time is short.
