数据结构期末 图

基本概念

 A directed graph is called strongly connected if there is a directed path from any vertex to any other vertex. If we suppress the direction of the edges and the resulting undirected graph is connected, we call the directed graph weakly connected.

图存储 邻接矩阵与邻接表

图的遍历(DFS,BFS)（必考)

拓扑排序(BFS方法)

最小生成树 概念与Prim算法

prim算法维护数组 S V-S 每次挑一个点出来 最小距离做一次更新 扩展所连的点 松弛操作

数据结构期末 图

原文：https://www.cnblogs.com/wwqdata/p/12142216.html