THE RELATED BETWEEN REPRESENT GRAPHS AND THE NUMBER OF IT

Abstract

Graph theory is used in many applications such as finding the shortest path between two cities in a transportation network. To solve a problem by graph theory, picking up a good algorithm is important as chosing a suitable data structure in representing weighted graphs.
This paper presents weight matrices, lists all edges to represent weight graphs, and shows the first way which is better than the second way in graphs having many edges, in contrast, the second way is better than the first way in graphs that has few edges. The problem of finding the shortest path on weight graphs is proved by experiment using Dijkstra algorithm to verify.