グラフ理論の基礎 - Basics of Graph Theory - ねらい グラフ理論の基礎を学ぶ グラフ (graph)、頂点 (vertex, node) 、辺 (edge) 連結リスト (linked list)、次数 (degree) 深さ優先探索 (depth-first search) 、幅優先探索 (width-first search) 連結成分 (connected components, connected subgraph, cluster) 、シングルトン (singleton) 切断点 (cut vertices) 、切断辺 (cut edges) 経路 (path) 、閉路 (cycle) 最小木 (minimum spanning tree)、最短経路 (shortest path) 巡回セールスマン問題 (traveling salesman probl
![グラフ理論の基礎 - Qiita](https://cdn-ak-scissors.b.st-hatena.com/image/square/f7c68f94d211f78c2503354c720ac112212cc448/height=288;version=1;width=512/https%3A%2F%2Fqiita-user-contents.imgix.net%2Fhttps%253A%252F%252Fcdn.qiita.com%252Fassets%252Fpublic%252Farticle-ogp-background-412672c5f0600ab9a64263b751f1bc81.png%3Fixlib%3Drb-4.0.0%26w%3D1200%26mark64%3DaHR0cHM6Ly9xaWl0YS11c2VyLWNvbnRlbnRzLmltZ2l4Lm5ldC9-dGV4dD9peGxpYj1yYi00LjAuMCZ3PTk3MiZoPTM3OCZ0eHQ9JUUzJTgyJUIwJUUzJTgzJUE5JUUzJTgzJTk1JUU3JTkwJTg2JUU4JUFCJTk2JUUzJTgxJUFFJUU1JTlGJUJBJUU3JUE0JThFJnR4dC1jb2xvcj0lMjMyMTIxMjEmdHh0LWZvbnQ9SGlyYWdpbm8lMjBTYW5zJTIwVzYmdHh0LXNpemU9NTYmdHh0LWFsaWduPWxlZnQlMkN0b3Amcz00ZTlmMzFhZDRhMWY5ZjdkZmM2OGFkNDEyZGEwZjE2Yg%26mark-x%3D142%26mark-y%3D57%26blend64%3DaHR0cHM6Ly9xaWl0YS11c2VyLWNvbnRlbnRzLmltZ2l4Lm5ldC9-dGV4dD9peGxpYj1yYi00LjAuMCZoPTc2Jnc9NzcwJnR4dD0lNDBtYXNrb3QxOTc3JnR4dC1jb2xvcj0lMjMyMTIxMjEmdHh0LWZvbnQ9SGlyYWdpbm8lMjBTYW5zJTIwVzYmdHh0LXNpemU9MzYmdHh0LWFsaWduPWxlZnQlMkN0b3Amcz1jMmZkYzM5MWIwNmFkNWFlNzRjNTZlMDQ2MzgyZmY0NQ%26blend-x%3D142%26blend-y%3D486%26blend-mode%3Dnormal%26s%3D59bc53bad516075a62799a6fa21c4e47)