izpis_h1_title_alt

Iskanje najkrajših poti med točkami telekomunikacijskega omrežja : diplomsko delo
ID Gobov, Miha (Author), ID Rožanc, Igor (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (1,88 MB)
MD5: DD756F09B7936CEE14049B8F62468C70

Language:Slovenian
Keywords:prostorski podatki, grafne podatkovne baze, problem iskanja najkrajših poti, Dijkstrin argoritem iskanja najkrajših poti, računalništvo, visokošolski strokovni študij, računalništvo in informatika, diplomske naloge
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of Computer and Information Science
Place of publishing:Ljubljana
Publisher:M. Gobov
Year:2014
Number of pages:38 str.
PID:20.500.12556/RUL-157913 This link opens in a new window
UDC:004.7(043.2)
COBISS.SI-ID:10700372 This link opens in a new window
Publication date in RUL:26.05.2024
Views:48
Downloads:7
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Searching for shortest paths between nodes of telecommunication network
Keywords:spatial data, graph database, shortest path problem, Dijkstra's algorithm for finding the shortest path, computer science, computer and information science, diploma

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back