izpis_h1_title_alt

Algoritmi nad grafi v jeziku linearne algebre : diplomsko delo
ID Toš, Tinkara (Author), ID Dobravec, Tomaž (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (5,04 MB)
MD5: D99FBE49138C49B6C7A4659E91A3286F

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 This link opens in a new window
UDC:004:512.64(043.2)
COBISS.SI-ID:9463124 This link opens in a new window
Publication date in RUL:26.05.2024
Views:135
Downloads:19
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and 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