<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=21899"><dc:title>Shortest path problem for nearly acyclic directed graphs</dc:title><dc:creator>Lazarevska,	Marija	(Avtor)
	</dc:creator><dc:creator>Požar,	Rok	(Mentor)
	</dc:creator><dc:creator>Brodnik,	Andrej	(Komentor)
	</dc:creator><dc:subject>algorithm</dc:subject><dc:subject>shortest path</dc:subject><dc:subject>nearly acyclic graph</dc:subject><dc:subject>directed graph</dc:subject><dc:subject>Dijkstra’s algorithm</dc:subject><dc:subject>priority queue</dc:subject><dc:subject>Fibonacci heap</dc:subject><dc:publisher>M. Lazarevska</dc:publisher><dc:date>2025</dc:date><dc:date>2025-10-13 00:03:01</dc:date><dc:type>Zaključna naloga</dc:type><dc:identifier>21899</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>