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
Algoritmi nad grafi v jeziku linearne algebre : diplomsko delo
ID
Toš, Tinkara
(
Author
),
ID
Dobravec, Tomaž
(
Mentor
)
More about this mentor...
PDF - Presentation file,
Download
(5,04 MB)
MD5: D99FBE49138C49B6C7A4659E91A3286F
Image galllery
Language:
Slovenian
Keywords:
matrika
,
sosedna matrika
,
matrika cene
,
redka matrika
,
teorija grafov
,
iskanje v širino
,
minimalne poti
,
Bellman-Fordov algoritem
,
Floyd-Warshallov algoritem
,
minimalno vpeto drevo
,
Primov algoritem
,
računalništvo
,
računalništvo in informatika
,
računalništvo in matematika
,
univerzitetni študij
,
interdisciplinarni študij
,
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:
T. Toš
Year:
2012
Number of pages:
101 str.
PID:
20.500.12556/RUL-157384
UDC:
004:512.64(043.2)
COBISS.SI-ID:
9463124
Publication date in RUL:
26.05.2024
Views:
230
Downloads:
33
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:
Graph algorithms in the language of linear algebra
Keywords:
matrix
,
adjacency matrix
,
sparse matrix
,
graph theory
,
breath first search
,
minimum path
,
Bellman-Ford algorithm
,
Floyd-Warshall algorithm
,
minimum spaning tree
,
Prim's algorithm
,
computer and information science
,
computer science and mathematics
,
interdisciplinary studies
,
diploma
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back