在Java中存储顶点-映射边缘

Question

I'm trying to build a graph with vertices, A, B, C & D. The graph must map an edge to a particular vertex if there is an overlap, For instance vertices A and C overlap as A has 1 -> 2, and C has 1 -> 4.

What would be an efficient way of storing these vertices then checking if their values overlap with one another?

Example:

A 1 2 3 4  
B 9 10 12 13  
C 1 4 2 3   
D 15 16 17 18 

Answer 1

It depends how often these graphs are expected to change. If it's just once off, storing the vertex constraint in a Map<Vertex, Set<Constraint> , calculating the intersections and then storing the final graph as an adjacency list or matrix is just fine.

You would do something like

For each vertex v:
   For each other vertex u
    if constraints(u) intersect constraints(v)
        add edge between u and v

You will end up with a symmetric un-directed graph.