DA:graphtree

隣接リストと隣接行列

## 無向グラフ
# 隣接リスト
V = [[] for i in range(5)]

V[0] = [1, 3, 4]
V[1] = [0, 2]
V[2] = [1, 4]
V[3] = [0]
V[4] = [0, 2]

# 隣接行列
E = [
    [0, 1, 0, 1, 1],
    [1, 0, 1, 0, 0],
    [0, 1, 0, 0, 1],
    [1, 0, 0, 0, 0],
    [1, 0, 1, 0, 0]
]


## 有向グラフ
# 隣接リスト
V = [[] for i in range(5)]

V[0] = [3]
V[1] = [0]
V[2] = [1]
V[4] = [0,2]

# 隣接行列
E = [
    [0, 0, 0, 1, 0],
    [1, 0, 0, 0, 0],
    [0, 1, 0, 0, 0],
    [0, 0, 0, 0, 0],
    [1, 0, 1, 0, 0]
]