Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
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...
PDF - Presentation file,
Download
(1,88 MB)
MD5: DD756F09B7936CEE14049B8F62468C70
Image galllery
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
UDC:
004.7(043.2)
COBISS.SI-ID:
10700372
Publication date in RUL:
26.05.2024
Views:
224
Downloads:
44
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
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