search

SiRumCz / CSC501

CSC501 assignments
0 stars 1 forks source link

1st. chord diagram #78

Open jonhealy1 opened 4 years ago

jonhealy1 commented 4 years ago

The graphs look amazing. For the first chord diagram you have this matrix:

const matrix = [ [11975, 5871, 8916, 2868], [1951, 10048, 2060, 6171], [8010, 16145, 8090, 8045], [1013, 990, 940, 6907] ];

I get that the numbers are weights and that each array corresponds to a different color but how does the number determine whether that weight is directed at orange or brown or whatever target?

soroushysfi commented 4 years ago

The graphs look amazing. For the first chord diagram you have this matrix:

const matrix = [ [11975, 5871, 8916, 2868], [1951, 10048, 2060, 6171], [8010, 16145, 8090, 8045], [1013, 990, 940, 6907] ];

I get that the numbers are weights and that each array corresponds to a different color but how does the number determine whether that weight is directed at orange or brown or whatever target?

If we divide adjacency matrix to two parts(from the diagonal line), the top part for example would be the ingoing edges from left side nodes to the ones in the top. The bottom part of the matrix would be outgoing edges from left side nodes to nodes on top. Does that make sense?

jonhealy1 commented 4 years ago

It kind of makes sense. I would need like a drawing or something to make sense of it.

jonhealy1 commented 4 years ago

@soroushysfi Soroush, I think that you need to try to build this adjacency matrix. I have no idea how to do it with cypher. I think that the easiest for you would be to build it using dataframes in python. I would like to do a little more with the graph algorithms.