系统结构图 数据结构_数据结构图简介
系統結構圖 數據結構
What you are going to learn?
你要學什么?
In this article, we learn about the introduction to Graphs in Data Structure and Algorithm.
在本文中,我們將了解圖在數據結構和算法中的介紹 。
What are the components in Graph?
圖中有哪些組件 ?
Types of the Graphs.
圖的類型 。
How we use the Graph data structure?
我們如何使用Graph數據結構?
圖形 (Graph)
The graph is an abstract data type in computer science. It maps the value between two data nodes.
該圖是計算機科學中的抽象數據類型。 它在兩個數據節點之間映射值。
Figure 1.1
圖1.1
組件 (Components)
1) Node: In the above example, Graph(Figure 1.1) there is a set of nodes. Nodes basically store values of data types ( int, float etc). In the example A, B, C, D, E, F are the nodes of the graph.
1)節點:在上面的示例Graph(圖1.1)中,有一組節點。 節點基本上存儲數據類型的值(int,float等)。 在示例中,A,B,C,D,E,F是圖的節點。
2) Edge: In the example graph, there is a set of edges in a graph. Edges make a relationship between two nodes or they are a connection between nodes in a graph. In the example e1 , e2, e3, e5, e6 ,e7,e8are the edges in that graph. Edges can be weighted or unweighted. In the case of a weighted edge, each edge is assigned a weight.
2)邊:在示例圖中,圖中有一組邊。 邊在兩個節點之間建立關系,或者它們是圖中節點之間的連接。 在示例e1,e2,e3,e5,e6,e7,e8是該圖中的邊緣。 邊緣可以加權或不加權。 在加權邊緣的情況下,為每個邊緣分配一個權重。
種類 (Types)
There are two types of graphs,
圖有兩種類型 ,
1) Directed Graph: When all the edges have a direction from one node to another node then the graph is called Directed Graph. (Figure 1.2)
1)有向圖:當所有邊都有從一個節點到另一個節點的方向時,該圖稱為有向圖。 (圖1.2)
Figure 1.2
圖1.2
2) Undirected Graph: When all the edges have no direction then it called Undirected Graph. The edges start from one node and go to another node. (Figure 1.1)
2)無向圖:當所有邊都沒有方向時,則稱為無向圖。 邊從一個節點開始,然后轉到另一節點。 (圖1.1)
Real life Application of graphs:
現實生活中的圖形應用:
Building recommendation system for e-commerce websites
建立電子商務網站推薦系統
Facebook friend circle
Facebook好友圈
GPS system Google maps
GPS系統谷歌地圖
翻譯自: https://www.includehelp.com/data-structure-tutorial/introduction-to-graph.aspx
系統結構圖 數據結構
總結
以上是生活随笔為你收集整理的系统结构图 数据结构_数据结构图简介的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: netfilter que_QUE的完整
- 下一篇: Python | 如何强制除法运算为浮点