Skip to main content
Call us
: 2810-393312
E-mail
:
helpdesk@uoc.gr
English (en)
Ελληνικά (el)
English (en)
You are currently using guest access
Log in
Home
Calendar
Home
Calendar
More
Expand all
Collapse all
Open course index
Open block drawer
ΗΥ-380
Αλγόριθμοι γραφων: DFS and BFS, Minimum spanning trees, Shortest path problems, Transitive closure.
Αλγόριθμοι γραφων: DFS and BFS, Minimum spanning trees, Shortest path problems, Transitive closure.
Section outline
Select activity Γράφοι
Γράφοι
File
Select activity Depth-First Search
Depth-First Search
File
Select activity Breadth First Search
Breadth First Search
File
Select activity Minimum Spanning Trees
Minimum Spanning Trees
File
Select activity Μελανέρυθρα δεντρα
Μελανέρυθρα δεντρα
File
Select activity Directed Graphs
Directed Graphs
File
Select activity Τα συντομότερα μονοπάτια (Shortest Paths)
Τα συντομότερα μονοπάτια (Shortest Paths)
File
Select activity Maximum Flow
Maximum Flow
File
