1.邻接表
图的邻接矩阵存储法,它的空间和时间复杂度都是N的平方
2.邻接矩阵
3.深度优先遍历
图的深度优先遍历类似于树的前序遍历。(根,左,右)
4.时间复杂度
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------