Exercise in Graphs and Networks

Course Purpose
In order to deepen the understanding of the contents of "Discrete Mathematics" and "Graphs and Networks", the students will observe the concept of graphs from various perspectives and solve problems on graph theory by using Python.
Learning Goals
The learning goals in this course are to formulate problems in graph theory and network theory, and to seek theoretical or algorithmic solutions.
Topic
Session 1Guidance, introduction to linear algebraic graph theory
Session 2NetworkX basics
Session 3Various graph functions in NetworkX
Session 4Enumerating graphs of small order
Session 5Trees and search (1) Depth-first search
Session 6Trees and search (2) Breadth-first search
Session 7Shortest path, Dijkstra's algorithm
Session 8Minimum spanning tree, Kruskal's algorithm, Prim's algorithm
Session 9Traveling salesman problem
Session 10Maximum matching
Session 11Vertex coloring
Session 12Introduction to random graphs
Session 13Complex networks and recursive models
Session 14Complex networks and random models
＊＊This content is based on April 1, 2025. For the latest syllabus information and details, please check the syllabus information inquiry page provided by the university.＊＊