Method for editing tourist route map and tourist information by virtue of timing digraph theory
A travel route and directed graph technology, applied in the field of travel content informatization
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0044] Assume that the user’s travel information is divided into four sections, which are the first section: starting from point a, passing through points b, c, d, c, b, and e and returning to point a; the second section: f point; the third paragraph: start from point g, pass through point h, and arrive at point i; the fourth paragraph: start from point h and arrive at point j. The corresponding actual example is, the first paragraph: Beijing (point a) to Zhengzhou (point b) to Wuhan (point c) to Hefei (point d) to Wuhan (point c) to Zhengzhou (point b) to Jinan (point e ) to Beijing (point a), the second section: Xuzhou (point f); the third section: Huaian (point g) to Yangzhou (point h) to Nanjing (point i); the fourth section: Yangzhou (point h) to Shanghai (point j).
[0045] figure 1 The upper middle part is the basic directed graph of time series directed graph, from which only the topological structure of the travel space can be seen. After expanding the time series p...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 