Load Adjacency Matrix

Back to Gallery

Tasks

Assume that the following is an adjacency matrix for an undirected graph on nodes A-E in order [ [0, 1, 1, 1, 0], [1, 0, 0, 0, 1], [1, 0, 0, 1, 1], [1, 0, 1, 0, 0], [0, 1, 1, 0, 0] ] Make all nodes squares

JSON Representation

{
"directed": false,
"hasParents": false,
"nodes": {
  "A": {
    "nodeShape": "square"
  },
  "B": {
    "nodeShape": "square"
  },
  "C": {
    "nodeShape": "square"
  },
  "D": {
    "nodeShape": "square"
  },
  "E": {
    "nodeShape": "square"
  }
},
"edges": {
  "AB": {
    "source": "A",
    "target": "B"
  },
  "AC": {
    "source": "A",
    "target": "C"
  },
  "AD": {
    "source": "A",
    "target": "D"
  },
  "BE": {
    "source": "B",
    "target": "E"
  },
  "CD": {
    "source": "C",
    "target": "D"
  },
  "CE": {
    "source": "C",
    "target": "E"
  }
},
"constraints": [],
"_positions": {
  "A": [
    -2.640778289055921,
    -3.613534705348436
  ],
  "B": [
    -4.2403567907799635,
    1.3908962259300406
  ],
  "C": [
    0.012402918719640318,
    4.483861783312955
  ],
  "D": [
    4.247603928582872,
    1.36731274029732
  ],
  "E": [
    2.6211282325333767,
    -3.6285360441918852
  ]
}
}