Undirected graph:<br> Connected graph: In an undirected graph, if any two points are connected, then the graph is called a connected graph.<br> Directed graph:<br> . Weakly connected: the base map (undirected graph) of a directed graph is a connected graph, and it is a weakly connected graph.<br> . One-way connectivity: in a directed graph, at least one of any node pairs is reachable, that is, one-way connectivity.<br> . Strongly connected: In a directed graph, a strongly connected graph is reachable in any pair.
正在翻译中..