{"id":"https://openalex.org/keywords/topological-sorting","display_name":"topological sorting","description":"Topological sorting is the ordering of vertices in a directed acyclic graph so that each edge points from an earlier vertex to a later one.","display_name_alternatives":["topological sort","topological ordering","topological sorts","topological orderings"],"ids":{"openalex":"https://openalex.org/keywords/topological-sorting","wikidata":"https://www.wikidata.org/wiki/Q753127"},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1204,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":1425,"cited_by_count":19267,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/topological-sorting","updated_date":"2026-11-17T04:05:58","created_date":"2022-04-12T19:38:12"}
