how to find all aliques of a node from an adjacency matrix?
1 visualización (últimos 30 días)
Mostrar comentarios más antiguos
i ran into a problem that find all cliques that a node have...
for example, here's an adjacency matrix:
X = [0 1 1 1 1
1 0 1 1 1
1 1 0 1 0
1 1 1 0 0
1 1 0 0 0];
1 means the two nodes can connect and 0 is the opposite meaning.
all the cliques that the first node have is [1 2 3 4] and [1 2 5], and that's the result i find by drawing a picture instead of by coding. my question is how to code and find the result?
i totally have no idea😭if anyone helps me, thanks a lot!!!
0 comentarios
Respuestas (0)
Ver también
Categorías
Más información sobre Directed Graphs en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!