On considère le graphe non orienté ci-dessous.
{"init": {"range": [[14.5, 217.64], [5.5, 271.96]], "scale": [2, 2]}, "label": [[[27.0, 116.08], "A", "left", {}], [[205.14, 213.1], "B", "above right", {}], [[27.562, 48.273], "C", "below left", {}], [[113.36, 259.46], "D", "above", {}], [[144.96, 62.004], "E", "below right", {}], [[95.744, 18.0], "F", "below", {}], [[111.79, 144.78], "G", "above", {}]], "line": [[[27.0, 116.08], [144.96, 62.004], {"subtype": "segment"}], [[27.0, 116.08], [95.744, 18.0], {"subtype": "segment"}], [[27.0, 116.08], [111.79, 144.78], {"subtype": "segment"}], [[144.96, 62.004], [111.79, 144.78], {"subtype": "segment"}], [[95.744, 18.0], [111.79, 144.78], {"subtype": "segment"}], [[205.14, 213.1], [111.79, 144.78], {"subtype": "segment"}], [[205.14, 213.1], [113.36, 259.46], {"subtype": "segment"}], [[113.36, 259.46], [111.79, 144.78], {"subtype": "segment"}], [[27.562, 48.273], [144.96, 62.004], {"subtype": "segment"}], [[27.562, 48.273], [95.744, 18.0], {"subtype": "segment"}], [[27.562, 48.273], [111.79, 144.78], {"subtype": "segment"}]], "circle": [[[27.0, 116.08], 2.0, {"fill": "#446CB3"}], [[205.14, 213.1], 2.0, {"fill": "#446CB3"}], [[27.562, 48.273], 2.0, {"fill": "#446CB3"}], [[113.36, 259.46], 2.0, {"fill": "#446CB3"}], [[144.96, 62.004], 2.0, {"fill": "#446CB3"}], [[95.744, 18.0], 2.0, {"fill": "#446CB3"}], [[111.79, 144.78], 2.0, {"fill": "#446CB3"}]]}
Déterminer la matrice d'adjacence de ce graphe en ordonnant les sommets dans l'ordre alphabétique.