{"id":"https://openalex.org/keywords/prim-s-algorithm","display_name":"Prim's algorithm","description":"Prim's algorithm is a greedy graph algorithm that constructs a minimum spanning tree of a connected weighted undirected graph.","display_name_alternatives":["Prim algorithm","Jarn\u00edk algorithm","Jarnik algorithm","Prim\u2013Jarn\u00edk algorithm","Prim-Jarnik algorithm","Prim\u2013Dijkstra algorithm","DJP algorithm","Dijkstra\u2013Jarn\u00edk\u2013Prim algorithm"],"ids":{"openalex":"https://openalex.org/keywords/prim-s-algorithm","wikidata":"https://www.wikidata.org/wiki/Q470813"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3535,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3535,"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":1191,"cited_by_count":8817,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/prim-s-algorithm","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
