Build an undirected adjacency map from a weighted edge list.
Self-loops are dropped. Parallel edges between the same pair are merged
by taking the maximum weight (so combined networks remain
well-defined when both committee and voting edges describe the same pair).
Parameters
nodeIds: readonlystring[]
Full node universe; nodes without edges still appear as empty maps.
Build an undirected adjacency map from a weighted edge list.
Self-loops are dropped. Parallel edges between the same pair are merged by taking the maximum weight (so combined networks remain well-defined when both committee and voting edges describe the same pair).