from collections import Counter, defaultdict def mesh(n): def node(k, i, j): if i == j == 0: return (-1, 0, 0) if not i: return ((k + 1) % 5, j, 0) return (k, i, j) index = {} triangles = [] for k in range(5): for i in range(n): for j in range(n - i): polys = [((i, j), (i+1, j), (i, j+1))] if i + j + 2 <= n: polys.append(((i+1, j+1), (i, j+1), (i+1, j))) for poly in polys: p = [node(k, *v) for v in poly] edges = [tuple(sorted((p[(s+1) % 3], p[(s+2) % 3]))) for s in range(3)] triangles.append(tuple(index.setdefault(e, len(index)) for e in edges)) counts = Counter(e for tr in triangles for e in tr) return triangles, [counts[i] for i in range(len(index))] def graph(triangles, weight_01, weight_12): edges = defaultdict(int) for e0, e1, e2 in triangles: for a, b, w in [(e0, e1, weight_01), (e0, e2, weight_01), (e1, e2, weight_12)]: edges[tuple(sorted((a, b)))] += w return edges