I have the following sets of 2D points. Each point represents a node.
x=[0 1 1 3 4 4 5];
y=[0 0 1 3 4 5 6];
If a point is within 1 unit of distance from another point they are considered neighbors. The following code creates a neighborhood matrix A in which 1 indicates that the corresponding nodes(points) are neighbors.
for i=1:n
for j=1:n
if dist(i,j)
I assume the points are the (X,Y) coordinates you give for the 7 pairs.
Here is the distance matrix (see EXCEL file). I am not sure why you think 1 2 6 are connected. I can read the matrix and see [1 2 3] and [5 6] are cliques. By the way I am using euclidean distance. You can replace my chart with the Manhattan metric (see lower half of page-- different distances, but essentially the same answer)
The pairs that are a value of 1 apart are highlighted. I think you could process this table to determine the cliques.
Dear Tariq,
Depending on your overall purposes, this may be a bit of an overkill, but you could check the Brain Connectivity Toolbox for Matlab (see the link), which provides a lot of graph-theoretical functions and measures, implemented in a computationally efficient manner. In particular, the function "get_components.m" would do exactly what you want (i.e., to solve the connected components of the graph), with the adjacency matrix A as the only input variable. Of course, such a function is probably included in every graph-theory toolbox you can find.
Cheers,
Pekko
https://sites.google.com/site/bctnet/Home
- Badges
- Science topic
- Similar topics
- Mathematics
- Algebra
- Matrix