Definition of graph
The logical structure of the graph
Basic terminology of graphs
The weight in the network graph refers to the cost of going from one node to another node
Undirected graph
All vertices are connected, it is called the connected graph and the
connected components are the maximal connected subgraphs of the unconnected graph
Note: Connectivity does not have to be that there must be an edge between the two vertices. From the start vertex to the end vertex after passing through several vertices, it is also considered that the start vertex and the end vertex are connected
Directed graph
Each vertex are called communication only strong graph
subgraph strongly connected component is a non strongly connected graph
Comparison of logical relationships in different structures
Definition of abstract data types for graphs
