"coreachable" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co",
        "3": "reachable"
      },
      "expansion": "co- + reachable",
      "name": "pre"
    }
  ],
  "etymology_text": "co- + reachable",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "coreachable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with co-",
          "parents": [],
          "source": "w"
        },
        {
          "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"
        }
      ],
      "examples": [
        {
          "ref": "2013, Marcello La Rosa, Pnina Soffer, Business Process Management Workshops: BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012, Revised Papers, page 118",
          "text": "Further, non coreachable nodes are qualified as forbidden. The loop terminates when all forbidden markings (those initially declared and those newly identified) are processed.",
          "type": "quotation"
        },
        {
          "ref": "2018, Cezar Câmpeanu, Implementation and Application of Automata: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings, page 77",
          "text": "Two cycles are coreachable if there exists a path from any of them to the other one.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Mutually reachable, that is, for any two nodes n1 and n2, they are coreachable iff n1 is reachable from n2 and n2 is reachable from n1."
      ],
      "id": "en-coreachable-en-adj-BLZLhX64",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "Mutually",
          "mutually"
        ],
        [
          "reachable",
          "reachable"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Mutually reachable, that is, for any two nodes n1 and n2, they are coreachable iff n1 is reachable from n2 and n2 is reachable from n1."
      ],
      "related": [
        {
          "word": "coreachability"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "coreachable"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co",
        "3": "reachable"
      },
      "expansion": "co- + reachable",
      "name": "pre"
    }
  ],
  "etymology_text": "co- + reachable",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "coreachable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "coreachability"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with co-",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Quotation templates to be cleaned",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "2013, Marcello La Rosa, Pnina Soffer, Business Process Management Workshops: BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012, Revised Papers, page 118",
          "text": "Further, non coreachable nodes are qualified as forbidden. The loop terminates when all forbidden markings (those initially declared and those newly identified) are processed.",
          "type": "quotation"
        },
        {
          "ref": "2018, Cezar Câmpeanu, Implementation and Application of Automata: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings, page 77",
          "text": "Two cycles are coreachable if there exists a path from any of them to the other one.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Mutually reachable, that is, for any two nodes n1 and n2, they are coreachable iff n1 is reachable from n2 and n2 is reachable from n1."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "Mutually",
          "mutually"
        ],
        [
          "reachable",
          "reachable"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Mutually reachable, that is, for any two nodes n1 and n2, they are coreachable iff n1 is reachable from n2 and n2 is reachable from n1."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "coreachable"
}