[RDF data]
Home | All courseInstance
PropertyValue
sisvu:academicYear 2003 (xsd:int)
is sisvu:courseInstanceLecturerOfCourseInstance of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/courseInstanceLecturer/1162/2003/26476>
is sisvu:courseInstanceLecturerOfCourseInstance of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/courseInstanceLecturer/1162/2003/34353>
is sisvu:courseInstanceLecturerOfCourseInstance of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/courseInstanceLecturer/1162/2003/34354>
is sisvu:courseInstanceLiterature of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/literature/1162/2003/1>
is sisvu:courseInstanceLiterature of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/literature/1162/2003/2>
is sisvu:courseInstanceLiterature of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/literature/1162/2003/3>
sisvu:courseInstanceOfCourseInstanceLecturer <http://kent.zpr.fer.hr:8080/educationalProgram/resource/courseInstanceLecturer/1162/2003/26476>
sisvu:courseInstanceOfCourseInstanceLecturer <http://kent.zpr.fer.hr:8080/educationalProgram/resource/courseInstanceLecturer/1162/2003/34353>
sisvu:courseInstanceOfCourseInstanceLecturer <http://kent.zpr.fer.hr:8080/educationalProgram/resource/courseInstanceLecturer/1162/2003/34354>
sisvu:description Definicije temeljnih pojmova teorije grafova. Usmjereni grafovi. Šetnje, staze i putovi. Ciklusi u grafu. Povezanost grafova. Stabla i šume. Eulerovske šetnje. Hamiltonovski ciklusi. Turniri. Planarni grafovi. Matrice incidencije i matrice susjedstva. Prikaz grafa na računalu. Mreže. Najkraći putovi. Dijkstrin algoritam. Protoci u transportnim mrežama. Ford-Fulkersonov algoritam. (hr)
is univ-ont:hasManifestation of <http://kent.zpr.fer.hr:8080/educationalProgram/resource/course/1162>
univ-ont:instanceOfCourse <http://kent.zpr.fer.hr:8080/educationalProgram/resource/course/1162>
rdf:type univ-ont:CourseInstance