File size: 1,427 Bytes
a39be45 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 |
import sys
from graph import tools
sys.path.extend(["../"])
num_node = 25
self_link = [(i, i) for i in range(num_node)]
inward_ori_index = [
(1, 2),
(2, 21),
(3, 21),
(4, 3),
(5, 21),
(6, 5),
(7, 6),
(8, 7),
(9, 21),
(10, 9),
(11, 10),
(12, 11),
(13, 1),
(14, 13),
(15, 14),
(16, 15),
(17, 1),
(18, 17),
(19, 18),
(20, 19),
(22, 23),
(23, 8),
(24, 25),
(25, 12),
]
inward = [(i - 1, j - 1) for (i, j) in inward_ori_index]
outward = [(j, i) for (i, j) in inward]
neighbor = inward + outward
class Graph:
def __init__(self, labeling_mode="spatial"):
self.A = self.get_adjacency_matrix(labeling_mode)
self.num_node = num_node
self.self_link = self_link
self.inward = inward
self.outward = outward
self.neighbor = neighbor
def get_adjacency_matrix(self, labeling_mode=None):
if labeling_mode is None:
return self.A
if labeling_mode == "spatial":
A = tools.get_spatial_graph(num_node, self_link, inward, outward)
else:
raise ValueError()
return A
if __name__ == "__main__":
import os
import matplotlib.pyplot as plt
# os.environ['DISPLAY'] = 'localhost:11.0'
A = Graph("spatial").get_adjacency_matrix()
for i in A:
plt.imshow(i, cmap="gray")
plt.show()
print(A)
|