[B! algorithm] maecchiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

maecchi id:maecchi

algorithmã«é–¢ã™ã‚‹maecchiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (4)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

æƒ…å ±ç³»ä¿®å£«ã«ã‚‚ã‚ã‹ã‚‹LOUDS - ã‚¢ã‚¹ãƒšæ—¥è¨˜
ä¸€å›žã§ã‚ã‹ã‚Šã‚„ã™ãæ›¸ãã®ã¯é›£ã—ã„ã®ã§ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ LOUDS ã®è§£èª¬ï¼ˆå…¨12å›žã€ç·´ç¿’å•é¡Œä»˜ãï¼‰ã¨ã„ã†ã‚·ãƒªãƒ¼ã‚ºã«ã¾ã¨ã‚ã¾ã—ãŸã€‚ (2014/01/26) å¤ã„å†…å®¹ã‚’å‰Šé™¤ã—ã¾ã—ãŸã€‚
maecchi 2012/03/04
algorithm

nlp
ãƒªãƒ³ã‚¯
ãƒ—ãƒªãƒ æ³•ï¼ˆæœ€å°å…¨åŸŸæœ¨å•é¡Œï¼‰
ãƒ—ãƒªãƒ æ³• (Prim's MST Algorithm) ã¯æœ€å°å…¨åŸŸæœ¨å•é¡Œã‚’åŠ¹çŽ‡çš„ã«è§£ãã‚°ãƒ©ãƒ•ç†è«–ã«ãŠã‘ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ æœ€å°å…¨åŸŸæœ¨ (MST: Minimum Spanning Tree) ã¨ã¯ï¼Œã‚°ãƒ©ãƒ•ã‚’æ§‹æˆã™ã‚‹ã€Œè¾ºã®é‡ã¿ã®ç·å’Œã€ãŒæœ€å°ã¨ãªã‚‹å…¨åŸŸæœ¨ã§ã™ã€‚ ã€Œå…¨åŸŸã€ã¨ã¯ï¼Œå…ƒã®ã‚°ãƒ©ãƒ•ãŒã‚ã£ã¦ï¼Œãã®éƒ¨åˆ†ã‚°ãƒ©ãƒ•ã®ã†ã¡ï¼ˆè¾ºã®æ§‹æˆã¯å¤‰ã‚ã£ã¦ã„ã¦ã‚‚ï¼‰é ‚ç‚¹é›†åˆãŒåŒã˜ã‚°ãƒ©ãƒ•ã‚’æŒ‡ã—ã¾ã™ã€‚ æœ¨ã¨ã¯é€£çµ (connected) ã§ã‹ã¤é–‰è·¯ (loop) ãŒç„¡ã„ã‚°ãƒ©ãƒ•ãªã®ã§ï¼Œã¤ã¾ã‚Šï¼Œå…ƒã¨ãªã‚‹ï¼ˆæœ¨ã§ã¯ãªã„ï¼‰ã‚°ãƒ©ãƒ•ãŒã‚ã£ã¦ï¼Œ ãã“ã‹ã‚‰ï¼Œåˆ‡ã‚Šé›¢ã•ã‚ŒãŸé ‚ç‚¹ã‚’ä½œã‚‰ãšã«ï¼ˆé€£çµã§ã‚ã‚Šï¼‰ï¼Œé–‰è·¯ã‚’ä½œã‚‹ã‚ˆã†ãªè¾ºãŒã€Œè¾ºã®é‡ã¿ã®ç·å’ŒãŒæœ€å°ã¨ãªã‚‹ã‚ˆã†ã«ã€å…¨ã¦å–ã‚Šé™¤ã‹ã‚ŒãŸï¼ˆæœ¨ã§ã‚ã‚‹ï¼‰ã‚°ãƒ©ãƒ•ã‚’æ±‚ã‚ã‚‹å•é¡Œã§ã™ã€‚ MSTï¼ˆæœ€å°å…¨åŸŸæœ¨ï¼‰ã‚’æ±‚ã‚ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã—ã¦ã¯ï¼Œã“ã“ã§èª¬æ˜Žã™ã‚‹ãƒ—ãƒªãƒ æ³•ã®ä»–ã«ã‚¯ãƒ©ã‚¹ã‚«ãƒ«æ³•ãŒæœ‰åã§ã™ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ä»¥ä¸‹ã®ã‚°ãƒ©ãƒ•ã‚’
maecchi 2012/03/03
algorithm
ãƒªãƒ³ã‚¯
å¤§è¦æ¨¡ã‚°ãƒ©ãƒ•ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æœ€å…ˆç«¯
Introduction of network analysis with Google Colaboratory -- Network Algorithms
maecchi 2012/01/14
algorithm
ãƒªãƒ³ã‚¯
é«˜é€Ÿãªå®‰å®šã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "TimSort" ã®è§£èª¬ - Preferred Networks Tech Blog
å…ˆæ—¥ã€TimSortã¨ã„ã†ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒè©±é¡Œã«ãªã‚Šã¾ã—ãŸã€‚TimSortã¯ã€é«˜é€Ÿãªå®‰å®šã‚½ãƒ¼ãƒˆã§ã€Python(>=2.3)ã‚„Java SE 7ã€ãŠã‚ˆã³Androidã§ã®æ¨™æº–ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã—ã¦æŽ¡ç”¨ã•ã‚Œã¦ã„ã‚‹ãã†ã§ã™ã€‚ C++ã®std::sort()ã‚ˆã‚Šã‚‚é«˜é€Ÿã§ã‚ã‚‹ã¨ã„ã†ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯çµæžœ1ãŒè©±é¡Œã«ãªã‚Š(å¾Œã«ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã®èª¤ã‚Šã¨åˆ¤æ˜Ž)ã€ç§ã‚‚ãã‚Œã§å˜åœ¨ã‚’çŸ¥ã‚Šã¾ã—ãŸã€‚å®Ÿéš›ã®ã¨ã“ã‚ã€ãƒ©ãƒ³ãƒ€ãƒ ãªãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ã¯ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ(IntroSort)ã»ã©é€Ÿããªã„ã‚ˆã†ã§ã™ãŒã€ã‚½ãƒ¼ãƒˆã¨ã„ã†ã‚·ãƒ³ãƒ—ãƒ«ãªã‚¿ã‚¹ã‚¯ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒä»Šã‚‚ãªãŠæ”¹è‰¯ã•ã‚Œç¶šã‘ã¦ã„ã¦ã€ãªãŠã‹ã¤äººã€…ã®é–¢å¿ƒã‚’å¼•ãã¨ã„ã†ã®ã¯èˆˆå‘³æ·±ã„ã‚‚ã®ã§ã™ã€‚ ã—ã‹ã—ãªãŒã‚‰ã€ã‚ªãƒªã‚¸ãƒŠãƒ«ã®TimSortã®ã‚³ãƒ¼ãƒ‰ã¯è‹¥å¹²è¤‡é›‘ã§ã€å®Ÿéš›ã®ã¨ã“ã‚ã©ã†ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãªã®ã‹ã‚ã‹ã‚Šã¥ã‚‰ã„ã¨ã“ã‚ãŒã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ãã“ã§ä»Šå›žã¯TimSortã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã§ãã‚‹ã ã‘ã‚ã‹ã‚Šã‚„ã™ãè§£
maecchi 2011/10/27
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

Algorithm
ãƒªãƒ³ã‚¯
1