table of Contents
Introduction to the graph
Subgraph: It can also be itself, or it can have only vertices without edges
Keyword concept
1. The degree of the vertex
2. The weight: the weight of the edge, which means the size or length of the edge linking two nodes
Connected graph and strongly connected graph
Minimum number of edges in connected graph: undirected graph n-1, directed graph n
Undirected complete graph and directed complete graph
Dense and sparse graphs
This article is referenced from "The King's Way"