{"json_modified": "2016-03-28T08:50:45.296530", "uuid": "e12933b8-2874-43f5-84ea-336090c376d4", "title": "Dominator", "url": "/en-US/docs/Glossary/Dominator", "tags": ["glossary", "CodingScripting", "Glossary"], "translations": [], "modified": "2016-02-19T16:27:46", "label": "Dominator", "localization_tags": [], "locale": "en-US", "id": 175887, "last_edit": "2016-02-19T16:27:44", "summary": "In graph theory, node A dominates node B if every path from the root node to B passes through A.", "sections": [{"id": "Learn_more", "title": null}, {"id": "General_knowledge", "title": null}, {"id": "Technical_reference", "title": "Technical reference"}], "slug": "Glossary/Dominator", "review_tags": []}