"strongly connected" meaning in English

{
  "derived": [
    {
      "_dis1": "47 53",
      "word": "strongly connected component"
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "strongly connected (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
      ],
      "id": "en-strongly_connected-en-adj-HMdOelX5",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "directed graph",
          "directed graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "32 68",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "31 69",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "27 73",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
      ],
      "id": "en-strongly_connected-en-adj-IudPjin~",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "directed graph",
          "directed graph"
        ],
        [
          "directed path",
          "directed path"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "Strongly connected component"
  ],
  "word": "strongly connected"
}

{
  "categories": [
    "English adjectives",
    "English adverb-adjective phrases",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English uncomparable adjectives",
    "Pages with 1 entry",
    "Pages with entries"
  ],
  "derived": [
    {
      "word": "strongly connected component"
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "strongly connected (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "en:Graph theory"
      ],
      "glosses": [
        "Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "directed graph",
          "directed graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        "en:Graph theory"
      ],
      "glosses": [
        "Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "directed graph",
          "directed graph"
        ],
        [
          "directed path",
          "directed path"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "Strongly connected component"
  ],
  "word": "strongly connected"
}