"Dijkstra's algorithm" meaning in All languages combined

{
  "etymology_text": "After its developer Edsger W. Dijkstra.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Dijkstra's algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "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"
        }
      ],
      "glosses": [
        "An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "id": "en-Dijkstra's_algorithm-en-name-oY5HICHn",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "path",
          "path"
        ],
        [
          "weighted",
          "weighted"
        ],
        [
          "digraph",
          "digraph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Dijkstra's algorithm",
        "Edsger W. Dijkstra"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈdaɪkstɹəz ˈælɡəɹɪðəm/",
      "tags": [
        "UK"
      ]
    }
  ],
  "word": "Dijkstra's algorithm"
}

{
  "etymology_text": "After its developer Edsger W. Dijkstra.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Dijkstra's algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "path",
          "path"
        ],
        [
          "weighted",
          "weighted"
        ],
        [
          "digraph",
          "digraph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Dijkstra's algorithm",
        "Edsger W. Dijkstra"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈdaɪkstɹəz ˈælɡəɹɪðəm/",
      "tags": [
        "UK"
      ]
    }
  ],
  "word": "Dijkstra's algorithm"
}