<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Arrangement107938773> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u4F18\u5148\u961F\u5217\uFF08priority queue\uFF09\u662F\u8BA1\u7B97\u673A\u79D1\u5B66\u4E2D\u7684\u4E00\u7C7B\u62BD\u8C61\u6570\u636E\u7C7B\u578B\u3002\u4F18\u5148\u961F\u5217\u4E2D\u7684\u6BCF\u4E2A\u5143\u7D20\u90FD\u6709\u5404\u81EA\u7684\u4F18\u5148\u7EA7\uFF0C\u4F18\u5148\u7EA7\u6700\u9AD8\u7684\u5143\u7D20\u6700\u5148\u5F97\u5230\u670D\u52A1\uFF1B\u4F18\u5148\u7EA7\u76F8\u540C\u7684\u5143\u7D20\u6309\u7167\u5176\u5728\u4F18\u5148\u961F\u5217\u4E2D\u7684\u987A\u5E8F\u5F97\u5230\u670D\u52A1\u3002\u4F18\u5148\u961F\u5217\u901A\u5E38\u4F7F\u7528\u300C\u5806\u7A4D\u300D\uFF08heap\uFF09\u5B9E\u73B0\u3002"@zh .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Batch_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Selection_sort> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"En informatique, une file de priorit\u00E9 est un type abstrait \u00E9l\u00E9mentaire sur laquelle on peut effectuer trois op\u00E9rations : \n* ins\u00E9rer un \u00E9l\u00E9ment ; \n* extraire l'\u00E9l\u00E9ment ayant la plus grande cl\u00E9 ; \n* tester si la file de priorit\u00E9 est vide ou pas. Ainsi, elle permet d'impl\u00E9menter efficacement des planificateurs de t\u00E2ches, o\u00F9 un acc\u00E8s rapide aux t\u00E2ches d'importance maximale est souhait\u00E9. On la retrouve par exemple dans les ordonnanceurs des syst\u00E8mes d'exploitation, notamment le noyau Linux."@fr .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Iterator> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C, \uC6B0\uC120\uC21C\uC704 \uD050(Priority queue)\uB294 \uD3C9\uBC94\uD55C \uD050\uB098 \uC2A4\uD0DD\uACFC \uBE44\uC2B7\uD55C \uCD95\uC57D \uC790\uB8CC\uD615\uC774\uB2E4. \uADF8\uB7EC\uB098 \uAC01 \uC6D0\uC18C\uB4E4\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC16\uACE0 \uC788\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uC5D0\uC11C, \uB192\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4 \uC6D0\uC18C\uB294 \uB0AE\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4 \uC6D0\uC18C\uBCF4\uB2E4 \uBA3C\uC800 \uCC98\uB9AC\uB41C\uB2E4. \uB9CC\uC57D \uB450 \uC6D0\uC18C\uAC00 \uAC19\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4\uB2E4\uBA74 \uADF8\uB4E4\uC740 \uD050\uC5D0\uC11C \uADF8\uB4E4\uC758 \uC21C\uC11C\uC5D0 \uC758\uD574 \uCC98\uB9AC\uB41C\uB2E4. \n* \uC2A4\uD0DD - \uC6D0\uC18C\uB4E4\uC740 \uD6C4\uC785 \uC120\uCD9C \uC21C\uC73C\uB85C \uCC98\uB9AC\uB41C\uB2E4. \n* \uD050 - \uC6D0\uC18C\uB4E4\uC740 \uC120\uC785 \uC120\uCD9C \uC21C\uC73C\uB85C \uCC98\uB9AC\uB41C\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uAC00 \uD799\uC774\uB77C\uB294 \uAC83\uC740 \uB110\uB9AC \uC54C\uB824\uC9C4 \uC624\uB958\uC774\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uB294 \"\uB9AC\uC2A4\uD2B8\"\uB098 \"\uB9F5\"\uACFC \uAC19\uC774 \uCD94\uC0C1\uC801\uC778 \uAC1C\uB150\uC774\uB2E4; \uB9C8\uCE58 \uB9AC\uC2A4\uD2B8\uB294 \uC5F0\uACB0 \uB9AC\uC2A4\uD2B8\uB098 \uBC30\uC5F4\uB85C \uAD6C\uD604\uB420 \uC218 \uC788\uB294 \uAC83\uACFC \uAC19\uC774, \uC6B0\uC120\uC21C\uC704 \uD050\uB294 \uD799\uC774\uB098 \uB2E4\uC591\uD55C \uB2E4\uB978 \uBC29\uBC95\uC744 \uC774\uC6A9\uD574 \uAD6C\uD604\uB420 \uC218 \uC788\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uB294 \uCD5C\uC18C\uD55C \uB2E4\uC74C\uC758 \uC5F0\uC0B0\uC774 \uC9C0\uC6D0 \uB418\uC5B4\uC57C \uD55C\uB2E4:"@ko .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/PsychologicalFeature100023100> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u0427\u0435\u0440\u0433\u0430 \u0437 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u0430\u043C\u0438 (\u0430\u043D\u0433\u043B. priority queue) \u2014 \u0446\u0435 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445, \u0449\u043E \u043F\u0440\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0430 \u0434\u043B\u044F \u043E\u0431\u0441\u043B\u0443\u0433\u043E\u0432\u0443\u0432\u0430\u043D\u043D\u044F \u043C\u043D\u043E\u0436\u0438\u043D\u0438 \u0435\u043B\u0435\u043C\u0435\u043D\u0442\u0456\u0432, \u043A\u043E\u0436\u043D\u0438\u0439 \u0437 \u044F\u043A\u0438\u0445 \u0434\u043E\u0434\u0430\u0442\u043A\u043E\u0432\u043E \u043C\u0430\u0454 \"\u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\", \u043F\u043E\u0432'\u044F\u0437\u0430\u043D\u0438\u0439 \u0437 \u043D\u0438\u043C. \u0423 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043D\u0456\u0439 \u0447\u0435\u0440\u0437\u0456 \u043F\u0435\u0440\u0448\u0438\u043C \u043E\u0431\u0441\u043B\u0443\u0433\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u0435\u043B\u0435\u043C\u0435\u043D\u0442, \u044F\u043A\u0438\u0439 \u043C\u0430\u0454 \u043D\u0430\u0439\u0432\u0438\u0449\u0438\u0439 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442, \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E \u0435\u043B\u0435\u043C\u0435\u043D\u0442, \u0449\u043E \u043C\u0430\u0454 \u043D\u0430\u0439\u043D\u0438\u0436\u0447\u0438\u0439 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442 \u0431\u0443\u0434\u0435 \u043E\u0431\u0441\u043B\u0443\u0433\u043E\u0432\u0430\u043D\u0438\u0439 \u043E\u0441\u0442\u0430\u043D\u043D\u0456\u043C. \u0423 \u0434\u0435\u044F\u043A\u0438\u0445 \u0440\u0435\u0430\u043B\u0456\u0437\u0430\u0446\u0456\u044F\u0445, \u044F\u043A\u0449\u043E \u0434\u0432\u0430 \u0435\u043B\u0435\u043C\u0435\u043D\u0442\u0438 \u043C\u0430\u044E\u0442\u044C \u043E\u0434\u043D\u0430\u043A\u043E\u0432\u0438\u0439 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442, \u0432\u043E\u043D\u0438 \u043F\u043E\u0434\u0430\u044E\u0442\u044C\u0441\u044F \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E \u0434\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0443, \u0432 \u044F\u043A\u043E\u043C\u0443 \u0432\u043E\u043D\u0438 \u0431\u0443\u043B\u0438 \u0437\u0430\u043A\u043B\u0430\u0434\u0435\u043D\u0456, \u0432 \u0442\u043E\u0439 \u0447\u0430\u0441 \u044F\u043A \u0432 \u0456\u043D\u0448\u0438\u0445 \u0440\u0435\u0430\u043B\u0456\u0437\u0430\u0446\u0456\u044F\u0445 \u0443\u043F\u043E\u0440\u044F\u0434\u043A\u0443\u0432\u0430\u043D\u043D\u044F \u0435\u043B\u0435\u043C\u0435\u043D\u0442\u0456\u0432 \u0437 \u043E\u0434\u043D\u0430\u043A\u043E\u0432\u0438\u043C \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C \u043D\u0435 \u0432\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u043E."@uk .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://sr.dbpedia.org/resource/\u0420\u0435\u0434_\u0441\u0430_\u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Bandwidth_(computing)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Heap_(data_structure)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Cua de prioritats"@ca .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://cs.dbpedia.org/resource/Prioritn\u00ED_fronta> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Pointer_(computer_programming)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://uk.dbpedia.org/resource/\u0427\u0435\u0440\u0433\u0430_\u0437_\u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Real-time_Transport_Protocol> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Category:Abstract_data_types> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://fi.dbpedia.org/resource/Prioriteettijono> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Group100031264> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://de.dbpedia.org/resource/Vorrangwarteschlange> .
<http://dbpedia.org/resource/Priority_queue>	<http://purl.org/dc/terms/subject>	<http://dbpedia.org/resource/Category:Abstract_data_types> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://docs.python.org/library/heapq.html> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Math> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u03A3\u03C4\u03B7\u03BD \u03C0\u03BB\u03B7\u03C1\u03BF\u03C6\u03BF\u03C1\u03B9\u03BA\u03AE, \u03BC\u03B9\u03B1 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03AD\u03BD\u03B1\u03C2 \u03B1\u03C6\u03B7\u03C1\u03B7\u03BC\u03AD\u03BD\u03BF\u03C2 \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03C0\u03BF\u03C5 \u03BC\u03BF\u03B9\u03AC\u03B6\u03B5\u03B9 \u03BC\u03B5 \u03C4\u03B7\u03BD \u03B1\u03C0\u03BB\u03AE \u03BF\u03C5\u03C1\u03AC \u03AE \u03C4\u03B7\u03BD \u03C3\u03C4\u03BF\u03AF\u03B2\u03B1, \u03B1\u03BB\u03BB\u03AC \u03B4\u03B9\u03B1\u03C6\u03AD\u03C1\u03B5\u03B9 \u03C3\u03C4\u03BF \u03CC\u03C4\u03B9 \u03B7 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1 \u03BA\u03AC\u03B8\u03B5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5 \u03B4\u03B5\u03BD \u03B5\u03BE\u03B1\u03C1\u03C4\u03AC\u03C4\u03B1\u03B9 \u03B1\u03C0\u03CC \u03C4\u03B7\u03BD \u03C3\u03B5\u03B9\u03C1\u03AC \u03B5\u03B9\u03C3\u03B1\u03B3\u03C9\u03B3\u03AE\u03C2 \u03C4\u03BF\u03C5 \u03C3\u03C4\u03B7\u03BD \u03BF\u03C5\u03C1\u03AC, \u03B1\u03BB\u03BB\u03AC \u03B1\u03C0\u03CC \u03BC\u03B9\u03B1 \u03C4\u03B9\u03BC\u03AE \u03C0\u03BF\u03C5 \u03BA\u03B1\u03BB\u03B5\u03AF\u03C4\u03B1\u03B9 \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF \u03C4\u03BF\u03C5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5. \u03A4\u03BF \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF \u03C4\u03C9\u03BD \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03C9\u03BD \u03C0\u03C1\u03AD\u03C0\u03B5\u03B9 \u03BD\u03B1 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03AD\u03BD\u03B1\u03C2 \u03C3\u03C5\u03B3\u03BA\u03C1\u03AF\u03C3\u03B9\u03BC\u03BF\u03C2 \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD, \u03B4\u03B7\u03BB\u03B1\u03B4\u03AE \u03B4\u03CD\u03BF \u03BF\u03C0\u03BF\u03B9\u03B1\u03B4\u03AE\u03C0\u03BF\u03C4\u03B5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03B1 \u03B1\u03C5\u03C4\u03BF\u03CD \u03C4\u03BF\u03C5 \u03C4\u03CD\u03C0\u03BF\u03C5 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03C0\u03C1\u03AD\u03C0\u03B5\u03B9 \u03BD\u03B1 \u03BC\u03C0\u03BF\u03C1\u03BF\u03CD\u03BD \u03BD\u03B1 \u03C3\u03C5\u03B3\u03BA\u03C1\u03AF\u03BD\u03BF\u03BD\u03C4\u03B1\u03B9. \u0393\u03B9\u03B1 \u03C0\u03B1\u03C1\u03AC\u03B4\u03B5\u03B9\u03B3\u03BC\u03B1, \u03BF boolean \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03B4\u03B5\u03BD \u03B5\u03AF\u03BD\u03B1\u03B9 \u03C3\u03C5\u03B3\u03BA\u03C1\u03AF\u03C3\u03B9\u03BC\u03BF\u03C2 (\u03B3\u03B9\u03B1\u03C4\u03AF \u03B4\u03B5\u03BD \u03C5\u03C0\u03AC\u03C1\u03C7\u03B5\u03B9 \u03B4\u03B9\u03AC\u03C4\u03B1\u03BE\u03B7 \u03BC\u03B5\u03C4\u03B1\u03BE\u03CD \u03C4\u03C9\u03BD \u03C4\u03B9\u03BC\u03CE\u03BD \u03B1\u03BB\u03B7\u03B8\u03B5\u03AF\u03B1\u03C2), \u03B1\u03BB\u03BB\u03AC \u03BF \u03B1\u03BA\u03AD\u03C1\u03B1\u03B9\u03BF\u03C2 \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03B5\u03AF\u03BD\u03B1\u03B9."@el .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/ROAM> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Connected_graph> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Rp> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Kolejka priorytetowa (ang. priority queue) \u2013 abstrakcyjny typ danych s\u0142u\u017C\u0105cy do reprezentowania zbioru element\u00F3w, z kt\u00F3rych ka\u017Cdy ma przyporz\u0105dkowan\u0105 warto\u015B\u0107 zwan\u0105 kluczem."@pl .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Container_(abstract_data_type)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Kolejka priorytetowa"@pl .
<http://dbpedia.org/resource/Priority_queue>	<http://xmlns.com/foaf/0.1/depiction>	<http://commons.wikimedia.org/wiki/Special:FilePath/Concurrent_prio_queue_conflict.svg> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Computer_science> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Introduction_to_Algorithms> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://sv.dbpedia.org/resource/Prioritetsk\u00F6> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/pages>	"138"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"\u4F18\u5148\u961F\u5217\uFF08priority queue\uFF09\u662F\u8BA1\u7B97\u673A\u79D1\u5B66\u4E2D\u7684\u4E00\u7C7B\u62BD\u8C61\u6570\u636E\u7C7B\u578B\u3002\u4F18\u5148\u961F\u5217\u4E2D\u7684\u6BCF\u4E2A\u5143\u7D20\u90FD\u6709\u5404\u81EA\u7684\u4F18\u5148\u7EA7\uFF0C\u4F18\u5148\u7EA7\u6700\u9AD8\u7684\u5143\u7D20\u6700\u5148\u5F97\u5230\u670D\u52A1\uFF1B\u4F18\u5148\u7EA7\u76F8\u540C\u7684\u5143\u7D20\u6309\u7167\u5176\u5728\u4F18\u5148\u961F\u5217\u4E2D\u7684\u987A\u5E8F\u5F97\u5230\u670D\u52A1\u3002\u4F18\u5148\u961F\u5217\u901A\u5E38\u4F7F\u7528\u300C\u5806\u7A4D\u300D\uFF08heap\uFF09\u5B9E\u73B0\u3002"@zh .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Container_(programming)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://rdf.freebase.com/ns/m.063rk> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"\u0427\u0435\u0440\u0433\u0430 \u0437 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u0430\u043C\u0438 (\u0430\u043D\u0433\u043B. priority queue) \u2014 \u0446\u0435 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445, \u0449\u043E \u043F\u0440\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0430 \u0434\u043B\u044F \u043E\u0431\u0441\u043B\u0443\u0433\u043E\u0432\u0443\u0432\u0430\u043D\u043D\u044F \u043C\u043D\u043E\u0436\u0438\u043D\u0438 \u0435\u043B\u0435\u043C\u0435\u043D\u0442\u0456\u0432, \u043A\u043E\u0436\u043D\u0438\u0439 \u0437 \u044F\u043A\u0438\u0445 \u0434\u043E\u0434\u0430\u0442\u043A\u043E\u0432\u043E \u043C\u0430\u0454 \"\u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\", \u043F\u043E\u0432'\u044F\u0437\u0430\u043D\u0438\u0439 \u0437 \u043D\u0438\u043C. \u0423 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043D\u0456\u0439 \u0447\u0435\u0440\u0437\u0456 \u043F\u0435\u0440\u0448\u0438\u043C \u043E\u0431\u0441\u043B\u0443\u0433\u043E\u0432\u0443\u0454\u0442\u044C\u0441\u044F \u0435\u043B\u0435\u043C\u0435\u043D\u0442, \u044F\u043A\u0438\u0439 \u043C\u0430\u0454 \u043D\u0430\u0439\u0432\u0438\u0449\u0438\u0439 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442, \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E \u0435\u043B\u0435\u043C\u0435\u043D\u0442, \u0449\u043E \u043C\u0430\u0454 \u043D\u0430\u0439\u043D\u0438\u0436\u0447\u0438\u0439 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442 \u0431\u0443\u0434\u0435 \u043E\u0431\u0441\u043B\u0443\u0433\u043E\u0432\u0430\u043D\u0438\u0439 \u043E\u0441\u0442\u0430\u043D\u043D\u0456\u043C. \u0423 \u0434\u0435\u044F\u043A\u0438\u0445 \u0440\u0435\u0430\u043B\u0456\u0437\u0430\u0446\u0456\u044F\u0445, \u044F\u043A\u0449\u043E \u0434\u0432\u0430 \u0435\u043B\u0435\u043C\u0435\u043D\u0442\u0438 \u043C\u0430\u044E\u0442\u044C \u043E\u0434\u043D\u0430\u043A\u043E\u0432\u0438\u0439 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442, \u0432\u043E\u043D\u0438 \u043F\u043E\u0434\u0430\u044E\u0442\u044C\u0441\u044F \u0432\u0456\u0434\u043F\u043E\u0432\u0456\u0434\u043D\u043E \u0434\u043E \u043F\u043E\u0440\u044F\u0434\u043A\u0443, \u0432 \u044F\u043A\u043E\u043C\u0443 \u0432\u043E\u043D\u0438 \u0431\u0443\u043B\u0438 \u0437\u0430\u043A\u043B\u0430\u0434\u0435\u043D\u0456, \u0432 \u0442\u043E\u0439 \u0447\u0430\u0441 \u044F\u043A \u0432 \u0456\u043D\u0448\u0438\u0445 \u0440\u0435\u0430\u043B\u0456\u0437\u0430\u0446\u0456\u044F\u0445 \u0443\u043F\u043E\u0440\u044F\u0434\u043A\u0443\u0432\u0430\u043D\u043D\u044F \u0435\u043B\u0435\u043C\u0435\u043D\u0442\u0456\u0432 \u0437 \u043E\u0434\u043D\u0430\u043A\u043E\u0432\u0438\u043C \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C \u043D\u0435 \u0432\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u043E. \u0425\u043E\u0447\u0430 \u0447\u0435\u0440\u0433\u0438 \u0437 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u0430\u043C\u0438 \u0447\u0430\u0441\u0442\u043E \u0440\u0435\u0430\u043B\u0456\u0437\u0443\u044E\u0442\u044C\u0441\u044F \u043A\u0443\u043F\u0430\u043C\u0438, \u0432\u043E\u043D\u0438 \u043A\u043E\u043D\u0446\u0435\u043F\u0442\u0443\u0430\u043B\u044C\u043D\u043E \u0432\u0456\u0434\u0440\u0456\u0437\u043D\u044F\u044E\u0442\u044C\u0441\u044F \u0432\u0456\u0434 \u043D\u0438\u0445. \u0427\u0435\u0440\u0433\u0430 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u0456\u0432 - \u0446\u0435 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u0435 \u043F\u043E\u043D\u044F\u0442\u0442\u044F, \u044F\u043A \"\u0441\u043F\u0438\u0441\u043E\u043A\" \u0430\u0431\u043E \"\u043A\u0430\u0440\u0442\u0430\"; \u0442\u0430\u043A \u0441\u0430\u043C\u043E, \u044F\u043A \u0441\u043F\u0438\u0441\u043E\u043A \u043C\u043E\u0436\u0435 \u0431\u0443\u0442\u0438 \u0440\u0435\u0430\u043B\u0456\u0437\u043E\u0432\u0430\u043D\u0430 \u0437\u0432'\u044F\u0437\u0430\u043D\u0438\u043C \u0441\u043F\u0438\u0441\u043A\u043E\u043C \u0430\u0431\u043E \u043C\u0430\u0441\u0438\u0432\u043E\u043C, \u0447\u0435\u0440\u0433\u0430 \u0437 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C \u043C\u043E\u0436\u0435 \u0431\u0443\u0442\u0438 \u0440\u0435\u0430\u043B\u0456\u0437\u043E\u0432\u0430\u043D\u0430 \u043A\u0443\u043F\u043E\u044E \u0430\u0431\u043E \u0431\u0435\u0437\u043B\u0456\u0447\u0447\u044E \u0456\u043D\u0448\u0438\u0445 \u043C\u0435\u0442\u043E\u0434\u0456\u0432, \u0442\u0430\u043A\u0438\u0445 \u044F\u043A \u043D\u0435\u0432\u043F\u043E\u0440\u044F\u0434\u043A\u043E\u0432\u0430\u043D\u0438\u0439 \u043C\u0430\u0441\u0438\u0432."@uk .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Join-based_tree_algorithms> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://web.archive.org/web/20121103132051/http:/www.theturingmachine.com/algorithms/heaps.html> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ca.dbpedia.org/resource/Cua_de_prioritats> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Stack_(abstract_data_type)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"En prioritetsk\u00F6 \u00E4r en abstrakt datatyp f\u00F6r att lagra och h\u00E4mta data. Skillnaden mot en vanlig k\u00F6 \u00E4r att n\u00E4r man plockar ut ett element ur k\u00F6n f\u00E5r man alltid ut det med l\u00E4gst/h\u00F6gst , oavsett i vilken ordning elementen lagts in. Till varje element i prioritetsk\u00F6n finns ett prioriteringsv\u00E4rde, detta kan utg\u00F6ra ett best\u00E4mt nummer eller kan det avg\u00F6ras av elementens inb\u00F6rdes ordning givet av n\u00E5gon j\u00E4mf\u00F6relsefunktion. Om man exempelvis lagrar namn i prioritetsk\u00F6n skulle elementen kunna ges prioritetsv\u00E4rden efter deras alfabetiska ordning."@sv .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"\uC6B0\uC120\uC21C\uC704 \uD050"@ko .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u041E\u0447\u0435\u0440\u0435\u0434\u044C \u0441 \u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C (\u0430\u043D\u0433\u043B. priority queue) \u2014 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u044B\u0439 \u0442\u0438\u043F \u0434\u0430\u043D\u043D\u044B\u0445 \u0432 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u0438, \u043F\u043E\u0434\u0434\u0435\u0440\u0436\u0438\u0432\u0430\u044E\u0449\u0438\u0439 \u0434\u0432\u0435 \u043E\u0431\u044F\u0437\u0430\u0442\u0435\u043B\u044C\u043D\u044B\u0435 \u043E\u043F\u0435\u0440\u0430\u0446\u0438\u0438 \u2014 \u0434\u043E\u0431\u0430\u0432\u0438\u0442\u044C \u044D\u043B\u0435\u043C\u0435\u043D\u0442 \u0438 \u0438\u0437\u0432\u043B\u0435\u0447\u044C \u043C\u0430\u043A\u0441\u0438\u043C\u0443\u043C (\u043C\u0438\u043D\u0438\u043C\u0443\u043C). \u041F\u0440\u0435\u0434\u043F\u043E\u043B\u0430\u0433\u0430\u0435\u0442\u0441\u044F, \u0447\u0442\u043E \u0434\u043B\u044F \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u044D\u043B\u0435\u043C\u0435\u043D\u0442\u0430 \u043C\u043E\u0436\u043D\u043E \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u044C \u0435\u0433\u043E \u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442 \u2014 \u0434\u0435\u0439\u0441\u0442\u0432\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E \u0438\u043B\u0438 \u0432 \u043E\u0431\u0449\u0435\u043C \u0441\u043B\u0443\u0447\u0430\u0435 \u044D\u043B\u0435\u043C\u0435\u043D\u0442 \u043B\u0438\u043D\u0435\u0439\u043D\u043E \u0443\u043F\u043E\u0440\u044F\u0434\u043E\u0447\u0435\u043D\u043D\u043E\u0433\u043E \u043C\u043D\u043E\u0436\u0435\u0441\u0442\u0432\u0430."@ru .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://it.dbpedia.org/resource/Coda_di_priorit\u00E0> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Template_(programming)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"Una cola de prioridades es un tipo de dato abstracto similar a una cola en la que los elementos tienen adicionalmente, una prioridad asignada.\u200B\u200B En una cola de prioridades un elemento con mayor prioridad ser\u00E1 desencolado antes que un elemento de menor prioridad. Si dos elementos tienen la misma prioridad, se desencolar\u00E1n siguiendo el orden de cola."@es .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Cognition100023271> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Bucket_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u512A\u5148\u4F47\u5217"@zh .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"1123776684"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Structure105726345> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageID>	"24485"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"En informatique, une file de priorit\u00E9 est un type abstrait \u00E9l\u00E9mentaire sur laquelle on peut effectuer trois op\u00E9rations : \n* ins\u00E9rer un \u00E9l\u00E9ment ; \n* extraire l'\u00E9l\u00E9ment ayant la plus grande cl\u00E9 ; \n* tester si la file de priorit\u00E9 est vide ou pas. Ainsi, elle permet d'impl\u00E9menter efficacement des planificateurs de t\u00E2ches, o\u00F9 un acc\u00E8s rapide aux t\u00E2ches d'importance maximale est souhait\u00E9. On la retrouve par exemple dans les ordonnanceurs des syst\u00E8mes d'exploitation, notamment le noyau Linux. On ajoute parfois \u00E0 cette liste l'op\u00E9ration \u00AB augmenter/diminuer la cl\u00E9 d'un \u00E9l\u00E9ment \u00BB, utilis\u00E9e par exemple dans l'algorithme de Dijkstra."@fr .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Dijkstra\u0027s_algorithm> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Line108430203> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Best-effort_service> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Tree_sort> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://en.cppreference.com/w/cpp/container/priority_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"Prioritn\u00ED fronta je abstraktn\u00ED datov\u00FD typ v informatice. K jeho prvk\u016Fm se na rozd\u00EDl od prvk\u016F oby\u010Dejn\u00E9 fronty v\u00E1\u017Ee je\u0161t\u011B priorita: Pokud maj\u00ED prvky stejnou prioritu, opou\u0161t\u00ED frontu v po\u0159ad\u00ED, v jak\u00E9m do n\u00ED byly vlo\u017Eeny, ale prvek s vy\u0161\u0161\u00ED prioritou prvky s ni\u017E\u0161\u00ED prioritou p\u0159edb\u011Bhne a jde na v\u00FDstup d\u0159\u00EDve. Set\u0159\u00EDd\u011Bn\u00E1 fronta tedy nab\u00EDz\u00ED p\u0159inejmen\u0161\u00EDm n\u00E1sleduj\u00EDc\u00ED dv\u011B operace: za\u0159a\u010F do fronty s udanou prioritoup\u0159ij\u00EDm\u00E1 jako vstup prvek a jeho prioritu a prvek s jeho prioritou za\u0159ad\u00ED do frontyvydej nejstar\u0161\u00ED z prvk\u016F s nejvy\u0161\u0161\u00ED prioritouodstran\u00ED z fronty ten z prvk\u016F s nejvy\u0161\u0161\u00ED prioritou, kter\u00FD je tam nejd\u00E9le, a vr\u00E1t\u00ED ho jako sv\u016Fj v\u00FDstup N\u011Bkdy jsou implementov\u00E1ny i dal\u0161\u00ED funkce, nap\u0159\u00EDklad mo\u017Enost zjistit prvek s nejvy\u0161\u0161\u00ED prioritou bez toho, \u017Ee by byl odstran\u011Bn."@cs .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u039F\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 (\u03B4\u03BF\u03BC\u03AE \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD)"@el .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Queueing_theory> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Queue108432345> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"Kolejka priorytetowa (ang. priority queue) \u2013 abstrakcyjny typ danych s\u0142u\u017C\u0105cy do reprezentowania zbioru element\u00F3w, z kt\u00F3rych ka\u017Cdy ma przyporz\u0105dkowan\u0105 warto\u015B\u0107 zwan\u0105 kluczem."@pl .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Array_data_structure> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://he.dbpedia.org/resource/\u05EA\u05D5\u05E8_\u05E2\u05D3\u05D9\u05E4\u05D5\u05D9\u05D5\u05EA> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Standard_Template_Library> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/.NET> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"\u03A3\u03C4\u03B7\u03BD \u03C0\u03BB\u03B7\u03C1\u03BF\u03C6\u03BF\u03C1\u03B9\u03BA\u03AE, \u03BC\u03B9\u03B1 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03AD\u03BD\u03B1\u03C2 \u03B1\u03C6\u03B7\u03C1\u03B7\u03BC\u03AD\u03BD\u03BF\u03C2 \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03C0\u03BF\u03C5 \u03BC\u03BF\u03B9\u03AC\u03B6\u03B5\u03B9 \u03BC\u03B5 \u03C4\u03B7\u03BD \u03B1\u03C0\u03BB\u03AE \u03BF\u03C5\u03C1\u03AC \u03AE \u03C4\u03B7\u03BD \u03C3\u03C4\u03BF\u03AF\u03B2\u03B1, \u03B1\u03BB\u03BB\u03AC \u03B4\u03B9\u03B1\u03C6\u03AD\u03C1\u03B5\u03B9 \u03C3\u03C4\u03BF \u03CC\u03C4\u03B9 \u03B7 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1 \u03BA\u03AC\u03B8\u03B5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5 \u03B4\u03B5\u03BD \u03B5\u03BE\u03B1\u03C1\u03C4\u03AC\u03C4\u03B1\u03B9 \u03B1\u03C0\u03CC \u03C4\u03B7\u03BD \u03C3\u03B5\u03B9\u03C1\u03AC \u03B5\u03B9\u03C3\u03B1\u03B3\u03C9\u03B3\u03AE\u03C2 \u03C4\u03BF\u03C5 \u03C3\u03C4\u03B7\u03BD \u03BF\u03C5\u03C1\u03AC, \u03B1\u03BB\u03BB\u03AC \u03B1\u03C0\u03CC \u03BC\u03B9\u03B1 \u03C4\u03B9\u03BC\u03AE \u03C0\u03BF\u03C5 \u03BA\u03B1\u03BB\u03B5\u03AF\u03C4\u03B1\u03B9 \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF \u03C4\u03BF\u03C5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5. \u03A4\u03BF \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF \u03C4\u03C9\u03BD \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03C9\u03BD \u03C0\u03C1\u03AD\u03C0\u03B5\u03B9 \u03BD\u03B1 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03AD\u03BD\u03B1\u03C2 \u03C3\u03C5\u03B3\u03BA\u03C1\u03AF\u03C3\u03B9\u03BC\u03BF\u03C2 \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD, \u03B4\u03B7\u03BB\u03B1\u03B4\u03AE \u03B4\u03CD\u03BF \u03BF\u03C0\u03BF\u03B9\u03B1\u03B4\u03AE\u03C0\u03BF\u03C4\u03B5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03B1 \u03B1\u03C5\u03C4\u03BF\u03CD \u03C4\u03BF\u03C5 \u03C4\u03CD\u03C0\u03BF\u03C5 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03C0\u03C1\u03AD\u03C0\u03B5\u03B9 \u03BD\u03B1 \u03BC\u03C0\u03BF\u03C1\u03BF\u03CD\u03BD \u03BD\u03B1 \u03C3\u03C5\u03B3\u03BA\u03C1\u03AF\u03BD\u03BF\u03BD\u03C4\u03B1\u03B9. \u0393\u03B9\u03B1 \u03C0\u03B1\u03C1\u03AC\u03B4\u03B5\u03B9\u03B3\u03BC\u03B1, \u03BF boolean \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03B4\u03B5\u03BD \u03B5\u03AF\u03BD\u03B1\u03B9 \u03C3\u03C5\u03B3\u03BA\u03C1\u03AF\u03C3\u03B9\u03BC\u03BF\u03C2 (\u03B3\u03B9\u03B1\u03C4\u03AF \u03B4\u03B5\u03BD \u03C5\u03C0\u03AC\u03C1\u03C7\u03B5\u03B9 \u03B4\u03B9\u03AC\u03C4\u03B1\u03BE\u03B7 \u03BC\u03B5\u03C4\u03B1\u03BE\u03CD \u03C4\u03C9\u03BD \u03C4\u03B9\u03BC\u03CE\u03BD \u03B1\u03BB\u03B7\u03B8\u03B5\u03AF\u03B1\u03C2), \u03B1\u03BB\u03BB\u03AC \u03BF \u03B1\u03BA\u03AD\u03C1\u03B1\u03B9\u03BF\u03C2 \u03C4\u03CD\u03C0\u03BF\u03C2 \u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD \u03B5\u03AF\u03BD\u03B1\u03B9. \u038C\u03C0\u03C9\u03C2 \u03BA\u03B1\u03B9 \u03C3\u03C4\u03B7\u03BD \u03B1\u03C0\u03BB\u03AE \u03BF\u03C5\u03C1\u03AC \u03BA\u03B1\u03B9 \u03C3\u03C4\u03B7 \u03C3\u03C4\u03BF\u03AF\u03B2\u03B1, \u03B7 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03C0\u03B1\u03C1\u03AD\u03C7\u03B5\u03B9 \u03C4\u03B9\u03C2 \u03B5\u03BE\u03AE\u03C2 \u03C0\u03C1\u03AC\u03BE\u03B5\u03B9\u03C2: \n* insert(element, key), \u03B3\u03B9\u03B1 \u03C4\u03B7\u03BD \u03B5\u03B9\u03C3\u03B1\u03B3\u03C9\u03B3\u03AE \u03B5\u03BD\u03CC\u03C2 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5 \u03BC\u03B5 \u03AD\u03BD\u03B1 \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF \u03BA\u03B1\u03B9 \n* extract_highest_priorty, \u03B3\u03B9\u03B1 \u03C4\u03B7\u03BD \u03B5\u03C0\u03B9\u03C3\u03C4\u03C1\u03BF\u03C6\u03AE \u03BA\u03B1\u03B9 \u03B4\u03B9\u03B1\u03B3\u03C1\u03B1\u03C6\u03AE \u03C4\u03BF\u03C5 \u03C0\u03C1\u03CE\u03C4\u03BF\u03C5 \u03C3\u03B5 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5. \u0395\u03AF\u03BD\u03B1\u03B9 \u03C3\u03B7\u03BC\u03B1\u03BD\u03C4\u03B9\u03BA\u03CC \u03BD\u03B1 \u03B1\u03BD\u03B1\u03C6\u03B5\u03C1\u03B8\u03B5\u03AF \u03CC\u03C4\u03B9 \u03B7 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03B4\u03B5\u03BD \u03C0\u03B1\u03C1\u03AD\u03C7\u03B5\u03B9 \u03C0\u03C1\u03CC\u03C3\u03B2\u03B1\u03C3\u03B7 \u03C3\u03B5 \u03CC\u03BB\u03B1 \u03C4\u03B1 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03B1 \u03C4\u03B7\u03C2, \u03C0\u03B1\u03C1\u03AC \u03BC\u03CC\u03BD\u03BF \u03C3\u03B5 \u03B1\u03C5\u03C4\u03CC \u03BC\u03B5 \u03C4\u03B7\u03BD \u03BC\u03B5\u03B3\u03B1\u03BB\u03CD\u03C4\u03B5\u03C1\u03B7 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1. \u039C\u03B9\u03B1 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03BC\u03C0\u03BF\u03C1\u03B5\u03AF \u03BD\u03B1 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03B5\u03BB\u03B1\u03C7\u03AF\u03C3\u03C4\u03BF\u03C5 \u03AE \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03BC\u03B5\u03B3\u03AF\u03C3\u03C4\u03BF\u03C5 \u03AE \u03BA\u03B1\u03B9 \u03C4\u03B1 \u03B4\u03CD\u03BF. \u03A3\u03C4\u03B7\u03BD \u03C0\u03C1\u03CE\u03C4\u03B7 \u03C0\u03B5\u03C1\u03AF\u03C0\u03C4\u03C9\u03C3\u03B7, \u03C4\u03BF \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF \u03BC\u03B5 \u03C4\u03B7\u03BD \u03BC\u03B5\u03B3\u03B1\u03BB\u03CD\u03C4\u03B5\u03C1\u03B7 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03B1\u03C5\u03C4\u03CC \u03C0\u03BF\u03C5 \u03AD\u03C7\u03B5\u03B9 \u03C4\u03BF \u03BC\u03B9\u03BA\u03C1\u03CC\u03C4\u03B5\u03C1\u03BF \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF, \u03B5\u03BD\u03CE \u03C3\u03C4\u03B7 \u03B4\u03B5\u03CD\u03C4\u03B5\u03C1\u03B7 \u03C0\u03B5\u03C1\u03AF\u03C0\u03C4\u03C9\u03C3\u03B7 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03B1\u03C5\u03C4\u03CC \u03C0\u03BF\u03C5 \u03AD\u03C7\u03B5\u03B9 \u03C4\u03BF \u03BC\u03B5\u03B3\u03B1\u03BB\u03CD\u03C4\u03B5\u03C1\u03BF \u03BA\u03BB\u03B5\u03B9\u03B4\u03AF. \u039A\u03B1\u03B9 \u03BF\u03B9 \u03B4\u03CD\u03BF \u03C0\u03B1\u03C1\u03B1\u03BB\u03BB\u03B1\u03B3\u03AD\u03C2 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03B9\u03C3\u03BF\u03B4\u03CD\u03BD\u03B1\u03BC\u03B5\u03C2, \u03BC\u03B5 \u03C4\u03B7\u03BD \u03AD\u03BD\u03BD\u03BF\u03B9\u03B1 \u03CC\u03C4\u03B9 \u03AD\u03C7\u03BF\u03C5\u03BD \u03C4\u03B7\u03BD \u03AF\u03B4\u03B9\u03B1 \u03B1\u03BA\u03C1\u03B9\u03B2\u03CE\u03C2 \u03B4\u03BF\u03BC\u03AE \u03BA\u03B1\u03B9 \u03B7 \u03B4\u03B9\u03B1\u03C6\u03BF\u03C1\u03AC \u03C4\u03BF\u03C5\u03C2 \u03AD\u03B3\u03BA\u03B5\u03B9\u03C4\u03B1\u03B9 \u03BC\u03CC\u03BD\u03BF \u03C3\u03C4\u03B7\u03BD \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1 \u03B5\u03BB\u03B1\u03C7\u03AF\u03C3\u03C4\u03BF\u03C5 \u03BA\u03B1\u03B9 \u03BC\u03B5\u03B3\u03AF\u03C3\u03C4\u03BF\u03C5. \u039C\u03B9\u03B1 \u03BF\u03C5\u03C1\u03AC \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03B5\u03BB\u03B1\u03C7\u03AF\u03C3\u03C4\u03BF\u03C5 \u03BA\u03B1\u03B9 \u03BC\u03B5\u03B3\u03AF\u03C3\u03C4\u03BF\u03C5 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03BC\u03B9\u03B1 \u03B2\u03B5\u03BB\u03C4\u03B9\u03C9\u03BC\u03AD\u03BD\u03B7 \u03C0\u03B1\u03C1\u03B1\u03BB\u03BB\u03B1\u03B3\u03AE \u03BC\u03B9\u03B1\u03C2 \u03BF\u03C5\u03C1\u03AC\u03C2 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2, \u03B7 \u03BF\u03C0\u03BF\u03AF\u03B1 \u03C5\u03C0\u03BF\u03C3\u03C4\u03B7\u03C1\u03AF\u03B6\u03B5\u03B9 \u03BC\u03AF\u03B1 \u03B1\u03BA\u03CC\u03BC\u03B7 \u03C0\u03C1\u03AC\u03BE\u03B7, \u03C4\u03B7\u03BD extract_lowest_priorty, \u03B3\u03B9\u03B1 \u03C4\u03B7\u03BD \u03B5\u03BE\u03B1\u03B3\u03C9\u03B3\u03AE \u03C4\u03BF\u03C5 \u03C3\u03C4\u03BF\u03B9\u03C7\u03B5\u03AF\u03BF\u03C5 \u03BC\u03B5 \u03C4\u03B7\u03BD \u03BC\u03B9\u03BA\u03C1\u03CC\u03C4\u03B5\u03C1\u03B7 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1. \u039F\u03B9 \u03C0\u03B1\u03C1\u03B1\u03BB\u03BB\u03B1\u03B3\u03AD\u03C2 \u03C4\u03B7\u03C2 \u03BF\u03C5\u03C1\u03AC\u03C2 \u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 \u03C0\u03BF\u03B9\u03BA\u03AF\u03BB\u03BF\u03C5\u03BD \u03BA\u03B1\u03B9 \u03B7 \u03BA\u03AC\u03B8\u03B5 \u03BC\u03AF\u03B1 \u03BC\u03C0\u03BF\u03C1\u03B5\u03AF \u03BD\u03B1 \u03C5\u03C0\u03BF\u03C3\u03C4\u03B7\u03C1\u03AF\u03B6\u03B5\u03B9 \u03B5\u03C0\u03B9\u03C0\u03BB\u03AD\u03BF\u03BD \u03C0\u03C1\u03AC\u03BE\u03B5\u03B9\u03C2 \u03B1\u03C0\u03CC \u03C4\u03B9\u03C2 \u03B4\u03CD\u03BF \u03B2\u03B1\u03C3\u03B9\u03BA\u03AD\u03C2."@el .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Weighted_graph> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Scheduling_(computing)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://el.dbpedia.org/resource/\u039F\u03C5\u03C1\u03AC_\u03C0\u03C1\u03BF\u03C4\u03B5\u03C1\u03B1\u03B9\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2_(\u03B4\u03BF\u03BC\u03AE_\u03B4\u03B5\u03B4\u03BF\u03BC\u03AD\u03BD\u03C9\u03BD)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"In computer science, a priority queue is an abstract data-type similar to a regular queue or stack data structure in which each element additionally has a priority associated with it. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued; in other implementations ordering of elements with the same priority remains undefined."@en .
<http://dbpedia.org/resource/Priority_queue>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://en.wikipedia.org/wiki/Priority_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://fa.dbpedia.org/resource/\u0635\u0641_\u0627\u0648\u0644\u0648\u06CC\u062A\u200C\u062F\u0627\u0631> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Minimum_spanning_tree> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"Una cua de prioritats en inform\u00E0tica, \u00E9s una estructura de dades amb comportament similar al de les cues, amb la difer\u00E8ncia que els elements amb m\u00E9s prioritat passen al davant de la cua. Les operacions habituals sobre una cua de prioritats s\u00F3n: \n* Les habituals dels contenidors: \n* Una operaci\u00F3 per comprovar si una cua est\u00E0 buida. \n* Una operaci\u00F3 per obtenir el nombre d'elements que cont\u00E9 la cua \n* Les espec\u00EDfiques d'una cua de prioritats: \n* Un constructor que crea una cua de prioritats buida \n* Una operaci\u00F3 per afegir un nou element al final de la cua, associant-hi una prioritat \n* Una operaci\u00F3 per obtenir (i eliminar) l'element del cap de la cua, aix\u00F2 \u00E9s, l'element amb la prioritat m\u00E9s alta"@ca .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Media_access_control> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Short_description> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Boost_(C++_libraries)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Heap_Running_Times> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Insertion_sort> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Prioritn\u00ED fronta"@cs .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"En prioritetsk\u00F6 \u00E4r en abstrakt datatyp f\u00F6r att lagra och h\u00E4mta data. Skillnaden mot en vanlig k\u00F6 \u00E4r att n\u00E4r man plockar ut ett element ur k\u00F6n f\u00E5r man alltid ut det med l\u00E4gst/h\u00F6gst , oavsett i vilken ordning elementen lagts in. Till varje element i prioritetsk\u00F6n finns ett prioriteringsv\u00E4rde, detta kan utg\u00F6ra ett best\u00E4mt nummer eller kan det avg\u00F6ras av elementens inb\u00F6rdes ordning givet av n\u00E5gon j\u00E4mf\u00F6relsefunktion. Om man exempelvis lagrar namn i prioritetsk\u00F6n skulle elementen kunna ges prioritetsv\u00E4rden efter deras alfabetiska ordning. P\u00E5 en prioritetsk\u00F6 m\u00E5ste man kunna utf\u00F6ra minst tv\u00E5 operationer: \n* L\u00E4gga till ett element i prioritetsk\u00F6n samt eventuellt ange dess prioritetsv\u00E4rde \n* Plocka ut det element som har l\u00E4gst (alternativt h\u00F6gst) prioritetsv\u00E4rde Vanligtvis har man \u00E4ven andra operationer, den vanligaste \u00E4r en som returnerar det element som har l\u00E4gst/h\u00F6gst prioritetsv\u00E4rde utan att avl\u00E4gsna det fr\u00E5n k\u00F6n."@sv .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Prioritn\u00ED fronta je abstraktn\u00ED datov\u00FD typ v informatice. K jeho prvk\u016Fm se na rozd\u00EDl od prvk\u016F oby\u010Dejn\u00E9 fronty v\u00E1\u017Ee je\u0161t\u011B priorita: Pokud maj\u00ED prvky stejnou prioritu, opou\u0161t\u00ED frontu v po\u0159ad\u00ED, v jak\u00E9m do n\u00ED byly vlo\u017Eeny, ale prvek s vy\u0161\u0161\u00ED prioritou prvky s ni\u017E\u0161\u00ED prioritou p\u0159edb\u011Bhne a jde na v\u00FDstup d\u0159\u00EDve. Set\u0159\u00EDd\u011Bn\u00E1 fronta tedy nab\u00EDz\u00ED p\u0159inejmen\u0161\u00EDm n\u00E1sleduj\u00EDc\u00ED dv\u011B operace: N\u011Bkdy jsou implementov\u00E1ny i dal\u0161\u00ED funkce, nap\u0159\u00EDklad mo\u017Enost zjistit prvek s nejvy\u0161\u0161\u00ED prioritou bez toho, \u017Ee by byl odstran\u011Bn."@cs .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Power_line_communication> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/List_(abstract_data_type)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Cisco_Systems,_Inc.> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"In der Informatik ist eine Vorrangwarteschlange (auch Priorit\u00E4tenliste, Priorit\u00E4tsschlange, Priorit\u00E4tswarteschlange oder englisch priority queue genannt) eine spezielle abstrakte Datenstruktur, genauer eine erweiterte Form einer Warteschlange. Den Elementen, die in die Warteschlange gelegt werden, wird ein Schl\u00FCssel mitgegeben, der die Reihenfolge der Abarbeitung der Elemente bestimmt."@de .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Heapsort> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://www.scala-lang.org/api/current/scala/collection/mutable/PriorityQueue.html> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"Nella teoria delle code, una coda di priorit\u00E0 \u00E8 una struttura dati astratta, simile ad una coda o ad una pila, ma diversa da queste in quanto ogni elemento inserito all'interno della coda possiede una sua \"priorit\u00E0\". In una coda di priorit\u00E0, ogni elemento avente priorit\u00E0 pi\u00F9 alta, viene inserito prima rispetto ad un elemento avente priorit\u00E0 pi\u00F9 bassa. In particolare, l'elemento con priorit\u00E0 pi\u00F9 alta si trova in testa alla coda, quello con priorit\u00E0 pi\u00F9 bassa si trover\u00E0, appunto, in coda."@it .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Job_scheduler> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/VoIP> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://developer.apple.com/library/mac/%23documentation/CoreFoundation/Reference/CFBinaryHeapRef/Reference/reference.html> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://th.dbpedia.org/resource/\u0E41\u0E16\u0E27\u0E04\u0E2D\u0E22\u0E25\u0E33\u0E14\u0E31\u0E1A\u0E04\u0E27\u0E32\u0E21\u0E2A\u0E33\u0E04\u0E31\u0E0D> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://en.wikipedia.org/wiki/Priority_queue?oldid=1123776684&ns=0> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://leekillough.com/heaps/> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Reflist> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/A*_search_algorithm> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Lee_Killough_(programmer)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Category:Priority_queues> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Una cua de prioritats en inform\u00E0tica, \u00E9s una estructura de dades amb comportament similar al de les cues, amb la difer\u00E8ncia que els elements amb m\u00E9s prioritat passen al davant de la cua. Les operacions habituals sobre una cua de prioritats s\u00F3n:"@ca .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Local_area_network> .
<http://dbpedia.org/resource/Priority_queue>	<http://purl.org/dc/terms/subject>	<http://dbpedia.org/resource/Category:Priority_queues> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://bg.dbpedia.org/resource/\u041F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442\u043D\u0430_\u043E\u043F\u0430\u0448\u043A\u0430> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Prioritetsk\u00F6"@sv .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatPriorityQueues> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Formation108426461> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://bitbucket.org/trijezdci/pqlib/src/> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Michael_Fredman> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Fibonacci_heap> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Adaptor_(programming)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://docs.microsoft.com/en-us/dotnet/api/system.collections.generic.priorityqueue-2%3Fview=net-6.0> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<https://global.dbpedia.org/id/4p1ki> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Huffman_coding> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Voice_over_Internet_Protocol> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Scala_(programming_language)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/SMA*> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Traffic> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"In der Informatik ist eine Vorrangwarteschlange (auch Priorit\u00E4tenliste, Priorit\u00E4tsschlange, Priorit\u00E4tswarteschlange oder englisch priority queue genannt) eine spezielle abstrakte Datenstruktur, genauer eine erweiterte Form einer Warteschlange. Den Elementen, die in die Warteschlange gelegt werden, wird ein Schl\u00FCssel mitgegeben, der die Reihenfolge der Abarbeitung der Elemente bestimmt."@de .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Sorting_algorithm> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Self-balancing_binary_search_tree> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"File de priorit\u00E9"@fr .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Element_(mathematics)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Binary_search_trees> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Prim\u0027s_algorithm> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Abstraction_(computer_science)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Undirected_graph> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Pairing_heap> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/File:BulkDeletionPQ.svg> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/IPTV> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Data_structures> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Linked_list> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Nella teoria delle code, una coda di priorit\u00E0 \u00E8 una struttura dati astratta, simile ad una coda o ad una pila, ma diversa da queste in quanto ogni elemento inserito all'interno della coda possiede una sua \"priorit\u00E0\". In una coda di priorit\u00E0, ogni elemento avente priorit\u00E0 pi\u00F9 alta, viene inserito prima rispetto ad un elemento avente priorit\u00E0 pi\u00F9 bassa. In particolare, l'elemento con priorit\u00E0 pi\u00F9 alta si trova in testa alla coda, quello con priorit\u00E0 pi\u00F9 bassa si trover\u00E0, appunto, in coda."@it .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Fusion_tree> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://github.com/vy/libpqueue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Word_size> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Peek_(data_type_operation)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://us2.php.net/manual/en/class.splpriorityqueue.php> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Discrete_event_simulation> .
<http://dbpedia.org/resource/Priority_queue>	<http://purl.org/linguistics/gold/hypernym>	<http://dbpedia.org/resource/Type> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/DataStructure105728493> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Computer_network> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Una cola de prioridades es un tipo de dato abstracto similar a una cola en la que los elementos tienen adicionalmente, una prioridad asignada.\u200B\u200B En una cola de prioridades un elemento con mayor prioridad ser\u00E1 desencolado antes que un elemento de menor prioridad. Si dos elementos tienen la misma prioridad, se desencolar\u00E1n siguiendo el orden de cola."@es .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/ITU-T> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/G.hn> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageLength>	"32595"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u512A\u5148\u5EA6\u4ED8\u304D\u30AD\u30E5\u30FC"@ja .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u512A\u5148\u5EA6\u4ED8\u304D\u30AD\u30E5\u30FC\uFF08\u3086\u3046\u305B\u3093\u3069\u3064\u304D\u30AD\u30E5\u30FC\u3001\u82F1: priority queue\uFF09\u306F\u3001\u4EE5\u4E0B\u306E4\u3064\u306E\u64CD\u4F5C\u3092\u30B5\u30DD\u30FC\u30C8\u3059\u308B\u62BD\u8C61\u30C7\u30FC\u30BF\u578B\u3067\u3042\u308B\u3002 \n* \u30AD\u30E5\u30FC\u306B\u5BFE\u3057\u3066\u8981\u7D20\u3092\u512A\u5148\u5EA6\u4ED8\u304D\u3067\u8FFD\u52A0\u3059\u308B\u3002 \n* \u6700\u3082\u9AD8\u3044\u512A\u5148\u5EA6\u3092\u6301\u3064\u8981\u7D20\u3092\u30AD\u30E5\u30FC\u304B\u3089\u53D6\u308A\u9664\u304D\u3001\u305D\u308C\u3092\u8FD4\u3059\u3002 \n* (\u30AA\u30D7\u30B7\u30E7\u30F3) \u6700\u3082\u9AD8\u3044\u512A\u5148\u5EA6\u3092\u6301\u3064\u8981\u7D20\u3092\u53D6\u308A\u9664\u304F\u3053\u3068\u306A\u304F\u53C2\u7167\u3059\u308B\u3002 \n* (\u30AA\u30D7\u30B7\u30E7\u30F3) \u6307\u5B9A\u3057\u305F\u8981\u7D20\u3092\u53D6\u308A\u9664\u304F\u3053\u3068\u306A\u304F\u512A\u5148\u5EA6\u3092\u5909\u66F4\u3059\u308B"@ja .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Ethernet_over_coax> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Standard_PHP_Library> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Callmanager> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ru.dbpedia.org/resource/\u041E\u0447\u0435\u0440\u0435\u0434\u044C_\u0441_\u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C_(\u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u0435)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Coda di priorit\u00E0"@it .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Compare-and-swap> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"In computer science, a priority queue is an abstract data-type similar to a regular queue or stack data structure in which each element additionally has a priority associated with it. In a priority queue, an element with high priority is served before an element with low priority. In some implementations, if two elements have the same priority, they are served according to the order in which they were enqueued; in other implementations ordering of elements with the same priority remains undefined. While coders often implement priority queues with heaps, they are conceptually distinct from heaps. A priority queue is a concept like a list or a map; just as a list can be implemented with a linked list or with an array, a priority queue can be implemented with a heap or with a variety of other methods such as an unordered array."@en .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u041E\u0447\u0435\u0440\u0435\u0434\u044C \u0441 \u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C (\u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u0435)"@ru .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://yago-knowledge.org/resource/Priority_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Abstraction100002137> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/thumbnail>	<http://commons.wikimedia.org/wiki/Special:FilePath/Concurrent_prio_queue_conflict.svg?width=300> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Lock_(computer_science)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Operational_semantics> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Skip_list> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Mvar> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"\u041E\u0447\u0435\u0440\u0435\u0434\u044C \u0441 \u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C (\u0430\u043D\u0433\u043B. priority queue) \u2014 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u044B\u0439 \u0442\u0438\u043F \u0434\u0430\u043D\u043D\u044B\u0445 \u0432 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u043C\u0438\u0440\u043E\u0432\u0430\u043D\u0438\u0438, \u043F\u043E\u0434\u0434\u0435\u0440\u0436\u0438\u0432\u0430\u044E\u0449\u0438\u0439 \u0434\u0432\u0435 \u043E\u0431\u044F\u0437\u0430\u0442\u0435\u043B\u044C\u043D\u044B\u0435 \u043E\u043F\u0435\u0440\u0430\u0446\u0438\u0438 \u2014 \u0434\u043E\u0431\u0430\u0432\u0438\u0442\u044C \u044D\u043B\u0435\u043C\u0435\u043D\u0442 \u0438 \u0438\u0437\u0432\u043B\u0435\u0447\u044C \u043C\u0430\u043A\u0441\u0438\u043C\u0443\u043C (\u043C\u0438\u043D\u0438\u043C\u0443\u043C). \u041F\u0440\u0435\u0434\u043F\u043E\u043B\u0430\u0433\u0430\u0435\u0442\u0441\u044F, \u0447\u0442\u043E \u0434\u043B\u044F \u043A\u0430\u0436\u0434\u043E\u0433\u043E \u044D\u043B\u0435\u043C\u0435\u043D\u0442\u0430 \u043C\u043E\u0436\u043D\u043E \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u044C \u0435\u0433\u043E \u043F\u0440\u0438\u043E\u0440\u0438\u0442\u0435\u0442 \u2014 \u0434\u0435\u0439\u0441\u0442\u0432\u0438\u0442\u0435\u043B\u044C\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E \u0438\u043B\u0438 \u0432 \u043E\u0431\u0449\u0435\u043C \u0441\u043B\u0443\u0447\u0430\u0435 \u044D\u043B\u0435\u043C\u0435\u043D\u0442 \u043B\u0438\u043D\u0435\u0439\u043D\u043E \u0443\u043F\u043E\u0440\u044F\u0434\u043E\u0447\u0435\u043D\u043D\u043E\u0433\u043E \u043C\u043D\u043E\u0436\u0435\u0441\u0442\u0432\u0430."@ru .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ja.dbpedia.org/resource/\u512A\u5148\u5EA6\u4ED8\u304D\u30AD\u30E5\u30FC> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://golang.org/pkg/container/heap/> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://fr.dbpedia.org/resource/File_de_priorit\u00E9> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Monotone_priority_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/edition>	"2"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Quality_of_service> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/C++> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ko.dbpedia.org/resource/\uC6B0\uC120\uC21C\uC704_\uD050> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Parallel_programming_model> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/File:Concurrent_prio_queue_conflict.svg> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Go_(programming_language)> .
<http://dbpedia.org/resource/Priority_queue>	<http://xmlns.com/foaf/0.1/depiction>	<http://commons.wikimedia.org/wiki/Special:FilePath/BulkDeletionPQ.svg> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Double-ended_priority_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/property/chapter>	"Section 6.5: Priority queues"@en .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Van_Emde_Boas_tree> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://www.wikidata.org/entity/Q629283> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Vertex_(graph_theory)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Command_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://en.cppreference.com/w/cpp/container/priority_queue> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Core_Foundation> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Binary_heap> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C, \uC6B0\uC120\uC21C\uC704 \uD050(Priority queue)\uB294 \uD3C9\uBC94\uD55C \uD050\uB098 \uC2A4\uD0DD\uACFC \uBE44\uC2B7\uD55C \uCD95\uC57D \uC790\uB8CC\uD615\uC774\uB2E4. \uADF8\uB7EC\uB098 \uAC01 \uC6D0\uC18C\uB4E4\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC16\uACE0 \uC788\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uC5D0\uC11C, \uB192\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4 \uC6D0\uC18C\uB294 \uB0AE\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4 \uC6D0\uC18C\uBCF4\uB2E4 \uBA3C\uC800 \uCC98\uB9AC\uB41C\uB2E4. \uB9CC\uC57D \uB450 \uC6D0\uC18C\uAC00 \uAC19\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4\uB2E4\uBA74 \uADF8\uB4E4\uC740 \uD050\uC5D0\uC11C \uADF8\uB4E4\uC758 \uC21C\uC11C\uC5D0 \uC758\uD574 \uCC98\uB9AC\uB41C\uB2E4. \n* \uC2A4\uD0DD - \uC6D0\uC18C\uB4E4\uC740 \uD6C4\uC785 \uC120\uCD9C \uC21C\uC73C\uB85C \uCC98\uB9AC\uB41C\uB2E4. \n* \uD050 - \uC6D0\uC18C\uB4E4\uC740 \uC120\uC785 \uC120\uCD9C \uC21C\uC73C\uB85C \uCC98\uB9AC\uB41C\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uAC00 \uD799\uC774\uB77C\uB294 \uAC83\uC740 \uB110\uB9AC \uC54C\uB824\uC9C4 \uC624\uB958\uC774\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uB294 \"\uB9AC\uC2A4\uD2B8\"\uB098 \"\uB9F5\"\uACFC \uAC19\uC774 \uCD94\uC0C1\uC801\uC778 \uAC1C\uB150\uC774\uB2E4; \uB9C8\uCE58 \uB9AC\uC2A4\uD2B8\uB294 \uC5F0\uACB0 \uB9AC\uC2A4\uD2B8\uB098 \uBC30\uC5F4\uB85C \uAD6C\uD604\uB420 \uC218 \uC788\uB294 \uAC83\uACFC \uAC19\uC774, \uC6B0\uC120\uC21C\uC704 \uD050\uB294 \uD799\uC774\uB098 \uB2E4\uC591\uD55C \uB2E4\uB978 \uBC29\uBC95\uC744 \uC774\uC6A9\uD574 \uAD6C\uD604\uB420 \uC218 \uC788\uB2E4. \uC6B0\uC120\uC21C\uC704 \uD050\uB294 \uCD5C\uC18C\uD55C \uB2E4\uC74C\uC758 \uC5F0\uC0B0\uC774 \uC9C0\uC6D0 \uB418\uC5B4\uC57C \uD55C\uB2E4: \n* insert_with_priority: \uD558\uB098\uC758 \uC6D0\uC18C\uB97C \uC6B0\uC120\uC21C\uC704\uB97C \uC9C0\uC815\uD558\uC5EC \uD050\uC5D0 \uCD94\uAC00\uD55C\uB2E4. \n* pull_highest_priority_element: \uAC00\uC7A5 \uB192\uC740 \uC6B0\uC120\uC21C\uC704\uB97C \uAC00\uC9C4 \uC6D0\uC18C\uB97C \uD050\uC5D0\uC11C \uC81C\uAC70\uD558\uACE0 \uC774\uB97C \uBC18\uD658\uD55C\uB2E4.\uC774\uAC83\uC740 \"pop_element(Off)\", \"get_maximum_element\", \uB610\uB294 \"get_front(most)_element\"\uB77C\uACE0 \uC54C\uB824\uC838 \uC788\uAE30\uB3C4 \uD558\uB2E4.\uC6B0\uC120\uC21C\uC704\uC758 \uC21C\uC11C\uB97C \uB4A4\uC9D1\uC5B4 \uB0AE\uC740 \uAC12\uC758 \uAC83\uC744 \uB192\uC740 \uC6B0\uC120\uB3C4\uB85C \uC0DD\uAC01\uD558\uB294 \uACBD\uC6B0\uB3C4 \uC788\uB294\uB370, \uC774\uAC83\uC740 \"get_minimum_element\"\uB77C\uACE0 \uC54C\uB824\uC838 \uC788\uACE0, \"get-min\"\uC774\uB77C\uACE0 \uC4F0\uAE30\uB3C4 \uD55C\uB2E4.pull_highest_priority_element\uB294 \"peek_at_highest_priority_element\"\uC640 \"delete_element\" \uD568\uC218\uB85C \uB098\uB258\uC5B4 \uC815\uC758\uB420 \uC218 \uC788\uB2E4. \uC774\uB4E4 \uC5F0\uC0B0 \uC774\uC678\uC5D0\uB3C4 \uB354 \uBCF5\uC7A1\uD55C \uC5F0\uC0B0\uC744 \uC9C0\uC6D0\uD558\uB294 \uACE0\uAE09 \uAE30\uB2A5\uB4E4\uC744 \uAD6C\uD604\uD560 \uC218\uB3C4 \uC788\uB2E4. \uC608\uB85C pull_lowest_priority_element\uB77C\uB294 \uC5F0\uC0B0\uC744 \uC815\uC758\uD574 \uCC98\uC74C \uB192\uC740 \uC6B0\uC120\uC21C\uC704\uB098 \uB0AE\uC740 \uC6B0\uC120\uC21C\uC704\uC758 \uC6D0\uC18C\uB4E4\uC744 \uC0B4\uD3B4\uBCF4\uB294 \uAE30\uB2A5\uC744 \uB9CC\uB4E4 \uC218\uB3C4 \uC788\uACE0, \uD050\uB97C \uBAA8\uB450 \uBE44\uC6B0\uAC70\uB098, \uD050\uC758 \uBD80\uBD84\uC9D1\uD569\uC744 \uBE44\uC6B0\uAC70\uB098, \uC5EC\uB7EC \uC6D0\uC18C\uB4E4\uC744 \uD55C\uBC88\uC5D0 \uC0BD\uC785\uD558\uAC70\uB098, \uB458 \uC774\uC0C1\uC758 \uD050\uB97C \uD558\uB098\uB85C \uBCD1\uD569\uD558\uAC70\uB098, \uC784\uC758\uC758 \uC6D0\uC18C\uC758 \uC6B0\uC120\uC21C\uC704\uB97C \uC99D\uAC00\uC2DC\uD0A4\uB294 \uB4F1\uC758 \uC5F0\uC0B0\uC744 \uC815\uC758\uD560 \uC218\uB3C4 \uC788\uB2E4."@ko .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://zh.dbpedia.org/resource/\u512A\u5148\u4F47\u5217> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Big_O_notation> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/IEEE_802.11> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatDataStructures> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Java_(programming_language)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://pl.dbpedia.org/resource/Kolejka_priorytetowa> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Cola de prioridades"@es .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Queue_(abstract_data_type)> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u0427\u0435\u0440\u0433\u0430 \u0437 \u043F\u0440\u0456\u043E\u0440\u0438\u0442\u0435\u0442\u043E\u043C"@uk .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://es.dbpedia.org/resource/Cola_de_prioridades> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Adjacency_list> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Associative_array> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Data_structures> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Abstract_data_type> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Array> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2002/07/owl#sameAs>	<http://lt.dbpedia.org/resource/Prioritet\u0173_eil\u0117> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Smoothsort> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Node_(graph_theory)> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/IEEE_802.11e> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Priority queue"@en .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Best-first_search> .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/2000/01/rdf-schema#label>	"Vorrangwarteschlange"@de .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/abstract>	"\u512A\u5148\u5EA6\u4ED8\u304D\u30AD\u30E5\u30FC\uFF08\u3086\u3046\u305B\u3093\u3069\u3064\u304D\u30AD\u30E5\u30FC\u3001\u82F1: priority queue\uFF09\u306F\u3001\u4EE5\u4E0B\u306E4\u3064\u306E\u64CD\u4F5C\u3092\u30B5\u30DD\u30FC\u30C8\u3059\u308B\u62BD\u8C61\u30C7\u30FC\u30BF\u578B\u3067\u3042\u308B\u3002 \n* \u30AD\u30E5\u30FC\u306B\u5BFE\u3057\u3066\u8981\u7D20\u3092\u512A\u5148\u5EA6\u4ED8\u304D\u3067\u8FFD\u52A0\u3059\u308B\u3002 \n* \u6700\u3082\u9AD8\u3044\u512A\u5148\u5EA6\u3092\u6301\u3064\u8981\u7D20\u3092\u30AD\u30E5\u30FC\u304B\u3089\u53D6\u308A\u9664\u304D\u3001\u305D\u308C\u3092\u8FD4\u3059\u3002 \n* (\u30AA\u30D7\u30B7\u30E7\u30F3) \u6700\u3082\u9AD8\u3044\u512A\u5148\u5EA6\u3092\u6301\u3064\u8981\u7D20\u3092\u53D6\u308A\u9664\u304F\u3053\u3068\u306A\u304F\u53C2\u7167\u3059\u308B\u3002 \n* (\u30AA\u30D7\u30B7\u30E7\u30F3) \u6307\u5B9A\u3057\u305F\u8981\u7D20\u3092\u53D6\u308A\u9664\u304F\u3053\u3068\u306A\u304F\u512A\u5148\u5EA6\u3092\u5909\u66F4\u3059\u308B"@ja .
<http://dbpedia.org/resource/Priority_queue>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Arrangement105726596> .
<http://dbpedia.org/resource/Priority_queue>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Router_(computing)> .