<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Algoritmi nad grafi - standardna in algebrska implementacija</dc:title><dc:creator>Knez,	Tinkara	(Avtor)
	</dc:creator><dc:creator>Dobravec,	Tomaž	(Mentor)
	</dc:creator><dc:subject>teorija grafov</dc:subject><dc:subject>grozdenje</dc:subject><dc:subject>iskanje najkrajših poti</dc:subject><dc:subject>Bellman Fordov algoritem</dc:subject><dc:subject>Floyd Warshallow algoritem</dc:subject><dc:subject>Dijkstrov algoritem</dc:subject><dc:subject>algoritem Markovega grozdenja</dc:subject><dc:subject>algoritem medsebojnega pritiska</dc:subject><dc:subject>matrika sosednosti</dc:subject><dc:publisher>[T. Knez]</dc:publisher><dc:date>2016</dc:date><dc:date>2018-12-03 11:00:19</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>105489</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>COBISS_ID: 17625689</dc:identifier><dc:language>sl</dc:language></metadata>
