Slide 36
Slide 36 text
2.2 グラフ理論
・グラフの表現
・隣接⾏列
・接続⾏列
・ノード集合とエッジ集合
36
1
2 3
4
5 6
隣接⾏列 接続⾏列 ノード集合とエッジ集合
G = (V, E)
V = {1,2,3,4,5}
E = {{1,2}, {1,3}, {2,1},
{2,3}, {2,4}, {2,5},
{3,1}, {3,2}, {4,2},
{4,5}, {5,2}, {5,4}}
AAACZXichVG7SgNBFD1ZXzEaEx+IYKEYIlZhVkTFKmhjmUSjgglhd53ExX2xuwnEkB8QW7WwUhARP8PGH7DIF4hYRrCx8O5mQTSod5iZM2fuuXNmRrY01XEZa4WEnt6+/oHwYGRoODoSi4+O7Thm1VZ4XjE1096TJYdrqsHzrupqfM+yuaTLGt+Vjza8/d0atx3VNLbdusWLulQx1LKqSC5RuUKzFE+wFPNjthuIAUggiIwZv0UBBzChoAodHAZcwhokONT2IYLBIq6IBnE2IdXf52giQtoqZXHKkIg9orFCq/2ANWjt1XR8tUKnaNRtUs4iyZ7YHWuzR3bPXtjHr7Uafg3PS51muaPlVil2MrX1/q9Kp9nF4ZfqT88uylj1vark3fIZ7xZKR187vmhvreWSjXl2zV7J/xVrsQe6gVF7U26yPHeJCH2A+PO5u8HOYkpcTi1llxLp9eArwpjGHBbovVeQxiYyyNO5ZZziDOehZyEqTAiTnVQhFGjG8S2EmU/hBYps
}情報量は同じ