Результат MediaWiki API

{
    "batchcomplete": "",
    "continue": {
        "gapcontinue": "Reachability",
        "continue": "gapcontinue||"
    },
    "warnings": {
        "main": {
            "*": "Subscribe to the mediawiki-api-announce mailing list at <https://lists.wikimedia.org/postorius/lists/mediawiki-api-announce.lists.wikimedia.org/> for notice of API deprecations and breaking changes."
        },
        "revisions": {
            "*": "Because \"rvslots\" was not specified, a legacy format has been used for the output. This format is deprecated, and in the future the new format will always be used."
        }
    },
    "query": {
        "pages": {
            "5298": {
                "pageid": 5298,
                "ns": 0,
                "title": "Reach-preservable graph",
                "revisions": [
                    {
                        "contentformat": "text/x-wiki",
                        "contentmodel": "wikitext",
                        "*": "'''Reach-preservable graph''' ---  \u0441\u043e\u0445\u0440\u0430\u043d\u044f\u044e\u0449\u0438\u0439 \u0434\u043e\u0441\u0442\u0438\u0436\u0438\u043c\u043e\u0441\u0442\u044c \u0433\u0440\u0430\u0444. \n\nGiven a '' spanning tree'' <math>T</math> of a graph <math>G</math>, a vertex <math>v \\in V(G)</math>\nis called ''' reach-preserving''' if the distance <math>d_{T}(v,w) =\nd_{G}(v,w)</math> for all <math>w</math> in <math>G</math>.\nA graph is called ''' reach-preservable graph''' if each of its spanning trees has a\nreach-preserving vertex.\n\nBy definition, it is clear that all trees are reach-preservable, and\nany cycle is reach-preservable. Furthermore, we can deduce that\nconnected '' unicyclic'' graphs are reach-presevable."
                    }
                ]
            },
            "5299": {
                "pageid": 5299,
                "ns": 0,
                "title": "Reach-preserving vertex",
                "revisions": [
                    {
                        "contentformat": "text/x-wiki",
                        "contentmodel": "wikitext",
                        "*": "'''Reach-preserving vertex''' --- \u0441\u043e\u0445\u0440\u0430\u043d\u044f\u044e\u0449\u0430\u044f \u0434\u043e\u0441\u0442\u0438\u0436\u0438\u043c\u043e\u0441\u0442\u044c \u0432\u0435\u0440\u0448\u0438\u043d\u0430.\n==See==\n*'' Reach-preservable graph''."
                    }
                ]
            }
        }
    }
}