strongly connected component in English

[Show JSON for postprocessed kaikki.org data shown on this page ▼] [Hide JSON for postprocessed kaikki.org data shown on this page ▲]

{
  "forms": [
    {
      "form": "strongly connected components",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "strongly connected component"
      },
      "expansion": "strongly connected component (plural strongly connected components)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English links with redundant alt parameters",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Czech translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "Given a directed graph, a maximal strongly connected subgraph."
      ],
      "id": "en-strongly_connected_component-en-noun-U9BCw7ax",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "directed graph",
          "directed graph"
        ],
        [
          "strongly connected",
          "strongly connected"
        ],
        [
          "subgraph",
          "subgraph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Given a directed graph, a maximal strongly connected subgraph."
      ],
      "related": [
        {
          "word": "connected component"
        },
        {
          "word": "partition"
        }
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "translations": [
        {
          "code": "cs",
          "lang": "Czech",
          "lang_code": "cs",
          "sense": "subgraph",
          "tags": [
            "feminine"
          ],
          "word": "silně souvislá komponenta"
        }
      ]
    }
  ],
  "word": "strongly connected component"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "forms": [
    {
      "form": "strongly connected components",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "strongly connected component"
      },
      "expansion": "strongly connected component (plural strongly connected components)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "connected component"
    },
    {
      "word": "partition"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English links with redundant alt parameters",
        "English multiword terms",
        "English nouns",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with Czech translations",
        "en:Graph theory"
      ],
      "glosses": [
        "Given a directed graph, a maximal strongly connected subgraph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "directed graph",
          "directed graph"
        ],
        [
          "strongly connected",
          "strongly connected"
        ],
        [
          "subgraph",
          "subgraph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Given a directed graph, a maximal strongly connected subgraph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "cs",
      "lang": "Czech",
      "lang_code": "cs",
      "sense": "subgraph",
      "tags": [
        "feminine"
      ],
      "word": "silně souvislá komponenta"
    }
  ],
  "word": "strongly connected component"
}

Download raw JSONL data for strongly connected component meaning in English (1.3kB)

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-11-18 from the enwiktionary dump dated 2025-11-01 using wiktextract (22806f4 and a050b89). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.

"strongly connected component" meaning in English

Noun

Inflected forms