图论中最长门路题目(国外英文资料).docVIP

图论中最短路径问题(国外英文资料) The shortest path problem is the graph theory Application in fire site selection 【 pick to 】 the shortest path problem is one of the typical graph theory to solve practical problems, can be used to solve the pipe installation, wiring, the factory layout and equipment updates, etc. The actual problem. This paper introduces the shortest path problem of graph theory and its algorithm, and applies the analysis method of the shortest path problem to solve the problem of location of city fire station. The shortest path; Floyd algorithm; fire 1 the introduction Graph theory is an important branch of operational research, aiming to solve the problem of discrete optimization, which has been developing rapidly in recent years. In peoples social practice, graph theory has become a solution of natural science, engineering, social science, biotechnology, and many problems in the economic, military and other fields of one of the powerful tool. Figure in graph theory, is not a general geometry or shape of the object, nor the figure in the engineering design drawings, but in the form of an abstract to express some certain objects, and these objects have or not have a certain relationship between a mathematical system. In other words, geometric shapes are statements The shape and structure of the object, the graph in the graph describes the relationship between certain things and these things. It is a typical representation of abstract intuitive thinking that is often used in mathematics. The basic idea of the diagram Definition of figure 2.1 An ordered trituple is called a diagram: (1) there is a poor, non-empty set, called a vertex set, whose elements are called vertices of the graph; (2) it is called an edge set, whose elements are called the edges of the graph; (3) the sequence of an ordered or unordered pair of sets from the edge set to the vertex set is called the associative function. Classification of 2.2 In the diagram, and the ordered pair is called figu