グラフç†è«–ã®åŸºç¤Ž - Qiitaグラフç†è«–ã®åŸºç¤Ž - 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
Pythonを使ã£ã¦ç°¡å˜ã«ãƒ‡ãƒ¼ã‚¿ã‚’視覚化ã™ã‚‹
{{#tags}}- {{label}}
{{/tags}}