Lecture Discrete Mathematics I - Chapter 9: More about graphs (Tran Vinh Tan) provide students with knowledge about connectivity, paths and circuits; euler and hamilton paths, euler paths and circuits, hamilton paths and circuits; shortest path problem, Dijkstra’s algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm, traveling salesman problem; . |