[B! graph] hiromarkã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

hiromark id:hiromark

graphã«é–¢ã™ã‚‹hiromarkã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (34)

${{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}}

projects:twitterã‚½ãƒ¼ã‚·ãƒ£ãƒ«ã‚°ãƒ©ãƒ•ã‹ã‚‰ã®ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£æŠ½å‡º [ryogrid.net]
ä»¥ä¸‹ã‚µã‚¤ãƒˆã§Twitterã®ã‚½ãƒ¼ã‚·ãƒ£ãƒ«ã‚°ãƒ©ãƒ•ãŒé…å¸ƒã•ã‚Œã¦ã„ã‚‹ã€‚ # 103ä¸‡äººåˆ†ã€2.8å„„ã‚¨ãƒƒã‚¸ã¨ã„ã†é©šæ„•ã®è¦æ¨¡ http://d.hatena.ne.jp/code46/20110130/p1 ä»Šå›žã€ã“ã®ãƒ‡ãƒ¼ã‚¿ã‚’é¡Œæã¨ã—ãŸã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£æŠ½å‡ºã®ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ›¸ã„ãŸã®ã§ã€é–‹ç™ºéŽç¨‹ã®ã„ã‚ã„ã‚ã‚’ã¾ã¨ã‚ã¦ãŠãã€‚ ä¸€éƒ¨ã€Amazon Elastic MapReduceã§ã®åˆ†æ•£å‡¦ç†ãªã©ã‚‚ã‚„ã£ã¦ã¿ãŸã®ã§ã€MapReduceã‚„Cloudã«èˆˆå‘³ã‚’æŒã¤äººã«ã‚‚åˆ©ç›ŠãŒã‚ã‚‹ã‹ã‚‚ã—ã‚Œãªã„ã€‚ç‰¹ã«ã€å®Ÿã‚¢ãƒ—ãƒªé–‹ç™ºã‚’é¡Œæã¨ã—ãŸäº‹ä¾‹ç´¹ä»‹ã¯Webä¸Šã§ã‚‚å°‘ãªã„ã‚ˆã†ãªã®ã§ã€ãã†ã„ã£ãŸä½ç½®ã¥ã‘ã§ã¯ä¾¡å€¤ãŒã‚ã‚‹ã®ã§ã¯ãªã„ã‹ã¨æ€ã†ã€‚ ã‚½ãƒ¼ã‚·ãƒ£ãƒ«ã‚°ãƒ©ãƒ•ã€ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£æŠ½å‡º(â‰’ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°?)ã®æ¦‚è¦ã«ã¤ã„ã¦ã¯ä»¥ä¸‹ãŒåˆ†ã‹ã‚Šã‚„ã™ã„ã€‚ http://www.slideshare.net/komiyaatsushi/newman-6670300 å®Ÿã¯ã€ä»¥å‰
hiromark 2011/09/18
ç¶šããŒæ¥½ã—ã¿ã€‚

twitter

graph

algorithm
ãƒªãƒ³ã‚¯
å¤§è¦æ¨¡ã‚°ãƒ©ãƒ•å‡¦ç†ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ Pregel ã®ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹å®Ÿè£… Bagel ã¨ã‹ - Standard ML of Yukkuri
ref: http://portal.acm.org/citation.cfm?id=1582723å¤§è¦æ¨¡ã‚°ãƒ©ãƒ•å‡¦ç†ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ Pregel ã®è«–æ–‡ã‚’èªã¿, BSP (Bulk Synchronous Parallel) ãƒ¢ãƒ‡ãƒ«ã§å®Ÿè£…ã—ãŸã„ã‚°ãƒ©ãƒ•ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒã„ãã¤ã‹ã‚ã£ãŸã®ã§ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹å®Ÿè£…ã‚’æŽ¢ã—ã¦ã¿ãŸ. GoldenOrb, Phoebus, HAMA (æ±Žç”¨çš„ãªBSP model), ãã—ã¦ Bagel ãªã©ã„ãã¤ã‹ã®å®Ÿè£…ãŒã‚ã‚‹ã‚ˆã†ã§, GoldenOrb ã¯ Java, Phoebus ã¯ Erlang ã§å®Ÿè£…ã•ã‚Œã¦ãŠã‚Š, Bagel ã¯ Scala ã§æ›¸ã‹ã‚Œã¦ã„ã‚‹. Bagel ã¯ Spark ä¸Šã§å‹•ãã‚·ãƒ³ãƒ—ãƒ«ãªå®Ÿè£… (ãŸã£ãŸã® 150 è¡Œç¨‹åº¦) ã§, å¤§è¦æ¨¡ãªã‚¿ã‚¹ã‚¯ã«å¯¾ã—ã¦ã‚‚ã‚¹ã‚±ãƒ¼ãƒ«ã™ã‚‹é‹ç”¨ãŒå¯èƒ½ã«æ€ãˆãŸã®ã§ Bagel ã‚’ä½¿ã£ã¦ã¿ã‚‹ã“ã¨ã«ã—ãŸ. (Phoebus ã¯
hiromark 2011/07/30
algorithm

graph

library
ãƒªãƒ³ã‚¯
Python ã§ã‚°ãƒ©ãƒ•ãƒ»(ç–Ž)è¡Œåˆ—è¨ˆç®—ã™ã‚‹ãŸã‚ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’ç´¹ä»‹ã™ã‚‹ã‚ˆ - æ¦è”µé‡Žæ—¥è¨˜
PageRank ã¨ã‹ HITS ã¨ã„ã£ãŸãƒªãƒ³ã‚¯è§£æžã§ã¯ã‚°ãƒ©ãƒ•ã®è¨ˆç®—ãŒé »ç™ºã™ã‚‹ã®ã ãŒã€Python ã§ãã®ã‚ãŸã‚Šæ›¸ãã¨ãã®è©±ã‚’ã¾ã¨ã‚ã¦ã¿ã‚‹ã€‚ã‚°ãƒ©ãƒ•ã¯è¡Œåˆ—ã§è¡¨ç¾ã§ãã‚‹(ãƒŽãƒ¼ãƒ‰Ã—ãƒŽãƒ¼ãƒ‰æ¬¡å…ƒã®è¡Œåˆ— A ã‚’è€ƒãˆã¦ã€ãƒŽãƒ¼ãƒ‰ i ã‹ã‚‰ãƒŽãƒ¼ãƒ‰ j ã«ã‚¨ãƒƒã‚¸ãŒã‚ã‚‹ã¨ãã€A[i,j] ã«å€¤ã‚’å…¥ã‚Œã¦ãŠã‘ã°ã‚ˆã„ã€‚ç„¡å‘ã‚°ãƒ©ãƒ•ã®ã¨ãã¯ A[i,j] = A[j,i] ãªã®ã§å¯¾ç§°è¡Œåˆ—ã«ãªã‚‹)ã®ã§ã€è¦ã¯è¡Œåˆ—ã‚’æ‰‹è»½ã«æ‰±ãˆã‚‹ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã®ç´¹ä»‹ã§ã‚ã‚‹ã€‚ å®Ÿã¯ Python ã®è¡Œåˆ—æ¼”ç®—ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã¯ã©ã‚Œã‚‚ lapack/blas ã‚’å†…éƒ¨çš„ã«å‘¼ã‚“ã§ã„ã‚‹ã®ã§ã€C/C++ ç‰ã¨æ¯”è¼ƒã—ã¦ã‚‚ãã‚“ãªã«é…ããªã„ã€‚ãã‚Œã©ã“ã‚ã‹ã€è‡ªå‹•çš„ã«ä¸¦åˆ—åŒ–ã§ãã‚‹ã¨ã“ã‚ã¯ä¸¦åˆ—åŒ–ã—ã¦ãã‚ŒãŸã‚Šã™ã‚‹ã®ã§ã€ã¾ã‚Œã« C ã‚ˆã‚Šé€Ÿã„ã“ã¨ã‚‚ã‚ã‚‹ã‚‰ã—ã„ã€‚ç‰¹ã«å·¨å¤§ãªã‚°ãƒ©ãƒ•ã‚’ä½œã‚‹å ´åˆã€ã»ã¨ã‚“ã©ã®å‡¦ç†ã¯ C ãªã©ã§æ›¸ã‹ã‚ŒãŸé–¢æ•°ã«é£›ã¶ã®ã§ã€é€Ÿåº¦çš„ãªå•é¡Œã¯ç„¡è¦–ã—ã¦ã‚‚ã„ã„ãã‚‰ã„ã§ã‚ã‚‹(é€†ã«ã€
hiromark 2011/05/30
python

library

graph

network
ãƒªãƒ³ã‚¯
Draw figures with gnuplot
The page requested has moved to http://ayapin-film.sakura.ne.jp/Gnuplot/gnuplot.html This page will automaticaly jump to new one in 5 sec.
hiromark 2011/05/29
Gnuplot, ã‚‚ã†ä½•å¹´ä½¿ã£ã¦ã„ãªã„ã‚“ã ã‚ã†ã€‚ã€‚ã€‚

graph

tool
ãƒªãƒ³ã‚¯
Amazon.co.jp: Graphs, Dioids and Semirings (Operations Research/Computer Science Interfaces Series, 41): Gondran, Michel, Minoux, Michel: æœ¬
hiromark 2010/12/13
ã“ã‚Œã‚ˆã‚“ã§ã¿ã‚ˆã†ã‹ãªã€‚

book

algorithm

graph

æ¬²ã—ã„
ãƒªãƒ³ã‚¯
How Breadth First Search uses Queue - agwã®æ—¥è¨˜
hiromark 2010/02/08
algorithm

graph
ãƒªãƒ³ã‚¯
ã‚¹ãƒšã‚¯ãƒˆãƒ©ãƒ«ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã¯æ¬¡å…ƒåœ§ç¸®ã—ãªãŒã‚‰Kmeansã™ã‚‹æ‰‹æ³• - æ¦è”µé‡Žæ—¥è¨˜
æ©Ÿæ¢°å¦ç¿’ç³»ã®ã‚¨ãƒ³ãƒˆãƒªã‚’ç¶šã‘ã¦æ›¸ã„ã¦ã¿ã‚‹ã€‚ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã«ã¤ã„ã¦çŸ¥ã‚‰ãªã„äººã¯ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªèªã‚“ã§ã‚‚ã¡ã‚“ã·ã‚“ã‹ã‚“ã·ã‚“ã ã¨æ€ã†ã®ã§ã€ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã¨ã„ã†æ¦‚å¿µã«ã¤ã„ã¦ã¯çŸ¥ã£ã¦ã„ã‚‹ã‚‚ã®ã¨ã™ã‚‹ã€‚ ãã‚Œã§ã€ä»Šæ—¥ã¯ã‚¹ãƒšã‚¯ãƒˆãƒ©ãƒ«ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã®è©±ã€‚è‡ªç„¶è¨€èªžå‡¦ç†ä»¥å¤–ã§ã‚‚åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ãŒã€ã“ã‚Œã¯ã‚°ãƒ©ãƒ•ã®ã‚¹ãƒšã‚¯ãƒˆãƒ«ã«åŸºã¥ãã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã®æ‰‹æ³•ã§ã€åŠæ•™å¸«ã‚ã‚Šå¦ç¿’ã¸ã®æ‹¡å¼µãŒã‚„ã‚Šã‚„ã™ã„ã®ãŒåˆ©ç‚¹ã€‚ãªã«ã‚’ã™ã‚‹ã‹ã¨ã„ã†ã¨ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã‚’ã‚°ãƒ©ãƒ•ã®åˆ†å‰²å•é¡Œ(ç–Žã§ã‚ã‚‹ã‚¨ãƒƒã‚¸ã‚’ã‚«ãƒƒãƒˆ)ã«å¸°ç€ã—ã¦è§£ãæ‰‹æ³•ã§ã€ã©ã†ã„ã†ãµã†ã«åˆ†å‰²ã™ã‚‹ã‹ã«ã‚ˆã£ã¦ Normalized cut (Ncut) ã¨ã‹ Min-max cut (Mcut) ã¨ã‹ã„ã‚ã„ã‚ã‚ã‚‹ã€‚ å®Œå…¨ã«ã‚°ãƒ©ãƒ•ãŒåˆ†å‰²ã§ãã‚‹å ´åˆã¯ã“ã‚Œã§ã‚ã§ãŸã—ã‚ã§ãŸã—ãªã®ã ãŒã€å®Ÿä¸–ç•Œã®ã‚°ãƒ©ãƒ•ã¯ãã‚“ãªç°¡å˜ã«åˆ‡ã‚Œãªã„ã“ã¨ãŒå¾€ã€…ã«ã—ã¦ã‚ã‚‹ã€‚ãã‚Œã§è¿‘ä¼¼ã—ã¦ã“ã®ã‚°ãƒ©ãƒ•åˆ†å‰²å•é¡Œã‚’è§£ãã®ã ãŒã€Normalized c
hiromark 2009/09/16
"çµå±€ã‚¹ãƒšã‚¯ãƒˆãƒ©ãƒ«ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ãŒã‚„ã£ã¦ã„ã‚‹ã®ã¯ã€æ£è¦åŒ–ã—ã¦ PCA ã‚„ SVD ã¨ã„ã£ãŸæ•™å¸«ãªã—ã®æ¬¡å…ƒåœ§ç¸®ã‚’ã‹ã‘ãŸã‚ã¨ã« Kmeans ã‹ã‘ã¦ã„ã‚‹"

algorithm

clustering

graph
ãƒªãƒ³ã‚¯
å®Œå…¨2éƒ¨ã‚°ãƒ©ãƒ•ã‚’Graphvizã¨Perlã‚’ä½¿ã£ã¦ç°¡å˜ã«æ›¸ãæ–¹æ³• - salmonsnareã®æ—¥è¨˜
[è¿½è¨˜: 2010/08/18] id:ksmemoã•ã‚“ãŒGraphVizãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚’ä½¿ã£ã¦æ›¸ã‹ã‚ŒãŸã‚³ãƒ¼ãƒ‰ã®æ–¹ãŒã™ã£ãã‚Šã—ã¦ã„ã‚‹ã®ã§ã“ã¡ã‚‰ã‚’æŽ¨å¥¨ã—ã¾ã™ã€‚ ã‚±ãƒ¼ã‚ºãƒ¡ãƒ¢, GraphVizã‚’ä½¿ã£ã¦Perlã§ç°¡å˜ã«Graphvizã§ã‚°ãƒ©ãƒ•ã‚’æ›¸ãæ–¹æ³•, http://d.hatena.ne.jp/ksmemo/20090903/p1 CPAN, GraphViz, http://search.cpan.org/dist/GraphViz/ ã¯ã˜ã‚ã« ã€Œé ‚ç‚¹æ•°ã®å¤§ããªå®Œå…¨2éƒ¨ã‚°ãƒ©ãƒ•ã‚’æ‰‹ã§æ›¸ãã‚ˆã‚Šã€è‡ªå‹•åŒ–ã—ãŸæ–¹ãŒã„ã„ã ã‚ã†ã€‚ã€ ã£ã¦ã„ã†å‹•æ©Ÿã§ã€ Graphvizã®ãƒ•ã‚¡ã‚¤ãƒ«å½¢å¼ã§ã‚ã‚‹ã€dotã‚’å‡ºåŠ›ã™ã‚‹ãŸã‚ã®Perlã‚¹ã‚¯ãƒªãƒ—ãƒˆã‚’æ›¸ãã¾ã—ãŸã€‚ Graphvizã¯ã€ã‚°ãƒ©ãƒ•ç†è«–ã§ã„ã†ã‚°ãƒ©ãƒ•ã‚’ç°¡å˜ã«æç”»ã™ã‚‹ãŸã‚ã®ä¾¿åˆ©ãªãƒ„ãƒ¼ãƒ«ã§ã™ã€‚ å°Žå…¥ã®è³‡æ–™ã¯ã€[1]ã«ç´¹ä»‹ã—ãŸã®ã§å‚ç…§ã—ã¦ãã ã•ã„ã€‚ å®Œå…¨2éƒ¨ã‚°ãƒ©ãƒ•ã¨ã¯ 2éƒ¨ã‚°ãƒ©
hiromark 2009/09/03
è‰²ã€…ä¾¿åˆ©ãã†ãªã‚„ã‚Šæ–¹ãªã®ã§ãƒ¡ãƒ¢ã€‚

perl

graph

algorithm

tips
ãƒªãƒ³ã‚¯
Toriumi Lab.
2024å¹´3æœˆ26æ—¥ ã€Œæƒ…å ±çš„å¥åº·ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆï¼šã‚¢ãƒ†ãƒ³ã‚·ãƒ§ãƒ³ã‚¨ã‚³ãƒŽãƒŸãƒ¼ã®æš—ç¿³ã¨ã€Žæƒ…å ±çš„å¥åº·ã€âˆ’ç·åˆçŸ¥ã§å‰µå‡ºã™ã‚‹å¥å…¨ãªè¨€è«–ç©ºé–“ã€ã‚’æ…¶æ‡‰ç¾©å¡¾å¤§&ã‚ªãƒ³ãƒ©ã‚¤ãƒ³ã§é–‹å‚¬ã•ã‚Œã¾ã—ãŸ. https://www.kgri.keio.ac.jp/news-event/156808.html æŸ»èªä»˜ãè«–æ–‡ãŒå‡ºç‰ˆã•ã‚Œã¾ã—ãŸï¼ŽMasaki Chujyo, Shu Liu, Fujio Toriumi "Improving network robustness against localized attacks by link modification", Nonlinear Theory and Its Applications, IEICE Volume 16 Issue 3 Pages 561-572 (07/2025) æŸ»èªä»˜ãè«–æ–‡ãŒå‡ºç‰ˆã•ã‚Œã¾ã—ãŸï¼ŽTakano, M., Nishiguchi, M. & T
hiromark 2009/07/17
ã“ã‚Œã¯ã†ã‚Œã—ã„ã‹ã‚‚ã€‚

algorithm

graph

c++

library
ãƒªãƒ³ã‚¯
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³• - Bug's Groove
å‰å›žã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³è¼ªè¬›ã®è©±é¡Œã€å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œã‹ã‚‰ã€‚è©³ã—ãã¯ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ç¬¬24ç« å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œ - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼ ã¸ã€‚ãã®ä¸ã§ä¸åº¦å‰å›ž æ›¸ã„ãŸãƒ—ãƒªãƒ æ³•ã¨åŒã˜ãã€ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ãŒæœ€å°å„ªå…ˆåº¦ä»˜ãã‚ãƒ¥ãƒ¼ã‚’ä½¿ã†ã®ã§ã€ã¡ã‚‡ã£ã¨ã„ã˜ã£ãŸã‚‰ã‹ã‘ã‚‹ã®ã§ã¯ï¼Ÿã¨æ€ã£ã¦æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚(ç›¸å¤‰ã‚ã‚‰ãšã®ä¹±ãƒ—ãƒã‚°ãƒ©ãƒ ã”å®¹èµ¦...)ã€‚å¯¾è±¡ã®ã‚°ãƒ©ãƒ•ã¯æ•™ç§‘æ›¸é€šã‚Šã€‚ å®Ÿè£…çš„ã«ã¯ã€minheap ã‚¯ãƒ©ã‚¹ã¯å‰å›žã®ãƒ—ãƒªãƒ æ³•ã¨å…¨ãä¸€ç·’ã€‚MinPriorityQueue ã¯å‰å›žã¨ä½¿ã„æ–¹ãŒé•ã†ã®ã§ä¸€éƒ¨å®Ÿè£…ã—ç›´ã—ã€‚(ã¨ã„ã£ã¦ã‚‚ relax ã®å‘¨ã‚Š)ã€‚å®Ÿè¡Œã™ã‚‹ã¨ã“ã‚“ãªæ„Ÿã˜ã«ãªã‚‹ã¯ãšã§ã™ã€‚ s -> y -> t (8) s -> y -> t -> x (9) s -> y (5) s -> y -> z (7) æ•™ç§‘æ›¸ã®ãƒ’ãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆ (6ç« ) ã«ã‚‚ã‚ã£ãŸã‚ˆã†ã«ã€å„ªå…ˆåº¦ä»˜ãã‚ãƒ¥ãƒ¼
hiromark 2009/06/30
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã® Python å®Ÿè£…ã€‚

graph

algorithm

python
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ç¬¬24ç« å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œ - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ã®è¼ªè¬›ã§ã€ç¬¬24ç« ã®å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œã‚’æ‹…å½“ã—ã¾ã—ãŸã€‚ç™ºè¡¨ã«ä½¿ã£ãŸè³‡æ–™ã‚’ä»¥ä¸‹ã«ã‚¢ãƒƒãƒ—ãƒãƒ¼ãƒ‰ã—ã¾ã—ãŸã€‚ http://bloghackers.net/~naoya/ppt/090622_shortest_paths.ppt SlideShare ã¯ã“ã¡ã‚‰ã€‚ãƒ•ã‚©ãƒ³ãƒˆã®é–¢ä¿‚ã§ã‚°ãƒ©ãƒ•ãŒå´©ã‚ŒãŸã‚Šã—ã¦ã„ã‚‹ã®ã§ã€ppt ã§å‚ç…§ã—ãŸæ–¹ãŒè¦‹ã‚„ã™ã„ã‹ã¨æ€ã„ã¾ã™ã€‚ Introduction to Algorithms#24 Shortest-Paths Probl emView more OpenOffice presentations from Naoya Ito. å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œã¯ã€é‡ã¿ä»˜ãæœ‰å‘ã‚°ãƒ©ãƒ•ã®æœ€çŸè·¯æœ¨ã‚’æ±‚ã‚ã‚‹å•é¡Œã§ã™ã€‚å„é ‚ç‚¹ã«æœ€çŸè·¯é‡ã¿ã‚’è¨˜éŒ²ã™ã‚‹ã®ã§ã™ãŒã€ã¯ã˜ã‚ã«å„é ‚ç‚¹ã®é‡ã¿ã‚’âˆžã¨ã—ã¦ã€ã€Œç·©å’Œã€ã¨å‘¼ã°ã‚Œã‚‹æ“ä½œã«ã‚ˆã‚Šå¾ã€…ã«é ‚ç‚¹ã®é‡ã¿ã‚’æœ€çŸè·¯é‡ã¿ã«è¿‘ã¥ã‘ã¦ã„ãã€ã¨ã„ã†ã®
hiromark 2009/06/23
åˆ†ã‹ã‚Šã‚„ã™ã„ãªã€‚çµæ§‹ã¾ã¨ã‚ã‚‹ã®é›£ã—ã„åˆ†é‡Žãªã®ã ã‘ã‚Œã©ã€‚

algorithm

graph
ãƒªãƒ³ã‚¯
Algo 23 MSTP
The document discusses algorithms for finding minimum spanning trees in graphs. It describes Prim's and Kruskal's algorithms, which both run in O(ElogV) time where E is the number of edges and V is the number of vertices. It also mentions that Fibonacci heaps can be used to implement Prim's algorithm in O(E+VlogV) time.
hiromark 2009/06/09
ã™ã£ã’ã‡ã€ã‚ã‹ã‚Šã‚„ã™ã„ã€‚

algorithm

graph
ãƒªãƒ³ã‚¯
ã‚°ãƒ©ãƒ•ç†è«–ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã®JGraphTã‚’ä½¿ã£ã¦ã¿ãŸ - kaisehã®ãƒ–ãƒã‚°
JGraphT JGraphTã¯ã€Javaã®ã‚°ãƒ©ãƒ•ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã™ã€‚ã‚°ãƒ©ãƒ•ã®æç”»ã§ã¯ãªãã€ã‚°ãƒ©ãƒ•ç†è«–ã®ãƒ¢ãƒ‡ãƒ«ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ–¹ã«ãƒ•ã‚©ãƒ¼ã‚«ã‚¹ã—ã¦ã„ã¾ã™ã€‚ã¨ã¦ã‚‚ä½¿ã„ã‚„ã™ã‹ã£ãŸã®ã§ã€ç´¹ä»‹ã—ã¦ã¿ã¾ã™ã€‚ ç„¡å‘ã‚°ãƒ©ãƒ• UndirectedGraph<String, DefaultEdge> g = new SimpleGraph<String, DefaultEdge>( DefaultEdge.class); g.addVertex("a"); g.addVertex("b"); g.addVertex("c"); g.addEdge("a", "b"); g.addEdge("b", "c"); System.out.println(g.vertexSet()); System.out.println(g.edgeSet()); System.out.println(g.edgesOf("c"));
hiromark 2009/04/20
ã»ã†ã€ã“ã‚“ãªã‚‚ã®ãŒï¼

java

graph

algorithm
ãƒªãƒ³ã‚¯
ã‚°ãƒ©ãƒ•ç†è«–ã®ã‚µã‚¤ãƒˆã¨æ›¸ç±ã®ã”ç´¹ä»‹ - salmonsnareã®æ—¥è¨˜
ã¯ã˜ã‚ã« [æ›´æ–°: 2013/4/22]ã„ãã¤ã‹æ›´æ–°ã—ã¾ã—ãŸã€‚ [/æ›´æ–°] Â§1ã§ã¯ã€ã‚°ãƒ©ãƒ•ç†è«–ã®WWWä¸Šã®è³‡æ–™ã§ã€Œã“ã‚Œã¯è‰¯ã‹ã£ãŸã€‚å½¹ã«ç«‹ã£ãŸã€‚ã€ã¨æ€ãˆã‚‹ã‚‚ã®ã‚’ã”ç´¹ä»‹ã—ã¾ã™ã€‚ ã©ã¡ã‚‰ã‹ã¨ã„ã†ã¨ã€ã‚°ãƒ©ãƒ•ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚ˆã‚Šæ•°å¦ã¨ã—ã¦ã®ã‚°ãƒ©ãƒ•ç†è«–ã‚’æ„è˜ã—ãŸè³‡æ–™ã‚’é¸ã³ã¾ã—ãŸã€‚ Â§2ã§ã¯ã€ã‚°ãƒ©ãƒ•ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç‰ã‚’å«ã‚€ã‚ˆã‚Šå°‚é–€çš„ãªæ›¸ç±ã‚’ã”ç´¹ä»‹ã—ã¾ã™ã€‚ 1. ã‚°ãƒ©ãƒ•ç†è«–ã®ã‚µã‚¤ãƒˆ Reinhard Diestel, Graph Theory Electronic Edition http://diestel-graph-theory.com/basic.html ãƒ‡ã‚£ãƒ¼ã‚¹ãƒ†ãƒ«å…ˆç”Ÿã®ã‚°ãƒ©ãƒ•ç†è«–ã®ãƒ†ã‚ã‚¹ãƒˆã®pdfç‰ˆã§ã™ã€‚åŸºç¤Žã‹ã‚‰å¿œç”¨ã¾ã§ä¸å¯§ã«æ›¸ã„ã¦ã‚ã‚Šã¾ã™ã€‚ å¿œç”¨ã«ã¤ã„ã¦ã¯ã»ã¨ã‚“ã©æ›¸ã‹ã‚Œã¦ãŠã‚Šã¾ã›ã‚“ãŒã€ãã®åˆ†æ•°å¦çš„ãªè‰²å½©ãŒå¼·ã„æœ¬ã§ã™ã€‚ ç›®æ¬¡ 1. The Basics: ã‚°ãƒ©ãƒ•ã®åŸºç¤Žã§ã™ã€‚æ¬¡æ•°ã‚„ãƒ‘ã‚¹ç‰ã®åŸºæœ¬çš„ãªå®š
hiromark 2009/03/14
ã–ã£ã¨çœºã‚ãŸã ã‘ã ã‘ã©ã€ãã‚Œãžã‚Œç•°ãªã£ãŸè¦–ç‚¹ã§ãŠã‚‚ã—ã‚ã„ã€‚

graph

algorithm
ãƒªãƒ³ã‚¯
æ±äº¬ã‚’èµ°ã‚‹è·¯ç·šã®ãƒ‡ãƒ¼ã‚¿ã‚’ä½¿ã£ã¦ã€æœ€çŸçµŒè·¯å•é¡Œã‚’ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã§è§£ã - imHo
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ãŒå°ã•ãªã‚µãƒ³ãƒ—ãƒ«ãƒ‡ãƒ¼ã‚¿ã§å‹•ã„ãŸã‚‰ã€å®Ÿéš›ã®ãƒ‡ãƒ¼ã‚¿ã‚’ä½¿ã£ã¦ã¿ãŸããªã‚‹ã®ãŒäººæƒ…ã€‚æ±äº¬ã‚’èµ°ã‚‹åœ°ä¸‹é‰„ã®ãƒ‡ãƒ¼ã‚¿ã§ã‚„ã£ã¦ã¿ãŸã„ã¨æ€ã£ãŸã€‚ JavaScriptã¨Prototype.jsã¨Google MapsAPIã¨ã™ã£ãŸã‚‚ã‚“ã ã—ãŸã‚ã’ãã€ãªã‚“ã¨ã‹å‹•ãã‚‚ã®ãŒã§ããŸã€‚ 502 Bad Gateway ãƒ†ã‚¹ãƒˆã‚¢ãƒ—ãƒªã¯ã“ã¡ã‚‰ JavaScriptã®ã‚½ãƒ¼ã‚¹ã¯ã“ã“ã®htmlã« é§…ã‚„è·¯ç·šã®ãƒ‡ãƒ¼ã‚¿ã¯é§…ãƒ‡ãƒ¼ã‚¿ï¼Žï½Šï½ã®ã‚‚ã®ã‚’ä½¿ã‚ã›ã¦ã‚‚ã‚‰ã„ã¾ã—ãŸã€‚ ä½¿ã£ãŸã®ã¯æ±äº¬ãƒ¡ãƒˆãƒï¼‹éƒ½å–¶ï¼‹å±±æ‰‹ç·š é§…ï¼ˆãƒŽãƒ¼ãƒ‰ï¼‰ã®æ•°ã¯ã€åŒã˜é§…ã§ã‚‚è·¯ç·šã”ã¨ã§åˆ¥ã«ã‚«ã‚¦ãƒ³ãƒˆã—ã¦ 322 é§…åŒå£«ã‚’ã¤ãªãç·šè·¯ï¼ˆã‚¨ãƒƒã‚¸ï¼‰ã®æ•°ã¯ã€å¾’æ©ã‚„ä¹—æ›ãˆã‚’å«ã‚ 912 ä½“æ„Ÿã‚‚ã£ã•ã‚Šæ„Ÿã˜ã‚‹ã‘ã©ã€çµŒè·¯ã®æ¤œç´¢ä»¥å¤–ã®ã¨ã“ã‚ãŒã‹ãªã‚Šã‹ã‹ã£ã¦ã‚‹ Tips Prototype.js Array.without ã¯è¶…é‡ã„ã€ä½¿ã†ãªï¼ Hash.keys ã§è¿”ã£ã¦ãã‚‹ã‚ãƒ¼ã¯ã™ã¹ã¦æ–‡å—åˆ—ã«
hiromark 2009/02/11
ãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã‚’å®Ÿãƒ‡ãƒ¼ã‚¿ã§ã€‚ãŠãŠãŠã€‚

algorithm

javascript

map

graph
ãƒªãƒ³ã‚¯
PRoxy Diary(2009-02-04) - [ç ”ç©¶å®¤] STOCã®è«–æ–‡ã®å†…å®¹
hiromark 2009/02/05
èˆˆå‘³æ·±ã„ã€‚

algorithm

graph

todo
ãƒªãƒ³ã‚¯
ãƒ‹ã‚³ãƒ‹ã‚³å‹•ç”»ã®å¤§è¦æ¨¡ãªãƒ‡ãƒ¼ã‚¿ã«å¯¾ã™ã‚‹ã‚¿ã‚°ä»˜ã‘ã¨ãƒªãƒ³ã‚¯è§£æž - æ¦è”µé‡Žæ—¥è¨˜
ãƒ‹ã‚³ãƒ‹ã‚³å‹•ç”»ãƒ‡ãƒ¼ã‚¿åˆ†æžç ”ç©¶ç™ºè¡¨ä¼šã¨ã„ã†ã®ãŒé–‹å‚¬ã•ã‚Œã¦ã„ãŸã‚ˆã†ã ã€‚ ã‚¿ã‚¤ãƒˆãƒ«ã‚„èª¬æ˜Žæ–‡ã¯ãƒŽã‚¤ã‚¸ãƒ¼ãªã®ã§ã€å‹•ç”»ã«ã¤ã‘ã‚‰ã‚ŒãŸã‚¿ã‚°ã‚’ä½¿ã†ã¨å‰²ã¨ãã‚Œã„ãªãƒ‡ãƒ¼ã‚¿ã¨ã—ã¦å¯è¦–åŒ–ã—ãŸã‚Šã§ãã‚‹ã€ã¨ã„ã†è©±ã¯ã€ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã®é–¢é€£ã‚¨ãƒ³ãƒˆãƒªãƒ¼æ©Ÿèƒ½ã®ã¨ãã‚‚èžã„ãŸã‚ˆã†ãªè©±ã§ã€åŸºæœ¬çš„ã«ã¯ã‚¤ãƒ³ã‚¿ãƒ¼ãƒãƒƒãƒˆãƒ¦ãƒ¼ã‚¶ã«ç„¡æ–™ã§ãƒ‡ãƒ¼ã‚¿ã®ã‚¿ã‚°ä»˜ã‘ã‚’ã—ã¦ã‚‚ã‚‰ã£ã¦ã„ã‚‹ã€ã¨ã„ã†è©±ãªã‚“ã ã‚ã†ãªã€ã¨æ€ã†ã€‚ä»¥å‰ç´¹ä»‹ã—ãŸRion Snow ã®è«–æ–‡ (å½¼ã¯2005å¹´ã« Microsoft Research ã§ã‚¤ãƒ³ã‚¿ãƒ¼ãƒ³ã—ã€2006å¹´ã« Powerset (ç¾åœ¨ã¯ Microsoft ã«è²·åŽæ¸ˆã¿)ã€2007å¹´ã«ã¯ Google ã§ã‚¤ãƒ³ã‚¿ãƒ¼ãƒ³ã—ãŸäººç‰©ã€‚ACL ã¨ã„ã†è‡ªç„¶è¨€èªžå‡¦ç†ã®ãƒˆãƒƒãƒ—ã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã§2006å¹´ã«ãƒ™ã‚¹ãƒˆãƒšãƒ¼ãƒ‘ãƒ¼å—è³ž)ã§ã€ ä»Šå¹´ã® Rion Snow ã®ãƒˆãƒ¼ã‚¯ã¯ã€Amazon Mechanical Turkã¨ã„ã†ã‚·ã‚¹ãƒ†ãƒ ã‚’ä½¿ã£ã¦ã€éžå¸¸ã«å®‰ä¾¡
hiromark 2009/01/27
æ·±è¿½ã„ã—ã¦ã¿ãŸã„ã€‚æ™‚é–“ãŒãªã„ã®ã§ä»Šå¾Œã®èª²é¡Œã€‚

algorithm

graph

geometry

clustering

todo
ãƒªãƒ³ã‚¯
è‡ªç„¶è¨€èªžå‡¦ç†ã«ãŠã‘ã‚‹é¡žä¼¼åº¦å¦ç¿’(æ©Ÿæ¢°å¦ç¿’ã«ãŠã‘ã‚‹è·é›¢å¦ç¿’)ã«ã¤ã„ã¦ - æ¦è”µé‡Žæ—¥è¨˜
Twitter ã§ã‚°ãƒ©ãƒ•ç†è«–ã«é–¢ã™ã‚‹è©±é¡ŒãŒä¸ŠãŒã£ã¦ã„ãŸã®ã§ã€æœ€è¿‘èª¿ã¹ã¦ã„ã‚‹è·é›¢å¦ç¿’(distance metric learning)ã«ã¤ã„ã¦å°‘ã—ã¾ã¨ã‚ã¦ã¿ã‚‹ã€‚ã‚«ãƒ¼ãƒãƒ«ã¨ã‹è·é›¢(é¡žä¼¼åº¦)ã¨ã‹ã‚’å¦ç¿’ã™ã‚‹ã¨ã„ã†è©±(ã‚«ãƒ¼ãƒãƒ«ã¨ã„ã†ã®ã¯2ç‚¹é–“ã®è¿‘ã•ã‚’æ¸¬ã‚‹é–¢æ•°ã ã¨æ€ã£ã¦ã‚‚ã‚‰ãˆã‚Œã°)ã€‚ ã“ã®åˆ†é‡Žã§ã¯ Liu Yang ã«ã‚ˆã‚‹A comprehensive survey on distance metric learning (2005) ãŒåŒ…æ‹¬çš„ãªã‚µãƒ¼ãƒ™ã‚¤è«–æ–‡ã¨ã—ã¦æœ‰åãªã‚ˆã†ã ãŒã€ãã‚Œã®ã‚¢ãƒƒãƒ—ãƒ‡ãƒ¼ãƒˆ(ã‹ã¤ç°¡ç•¥)ç‰ˆã¨ã—ã¦åŒã˜è‘—è€…ã«ã‚ˆã‚‹An overview of distance metric learning (2007) ãŒå‡ºã¦ã„ã‚‹ã®ã§ã€ãã‚Œã‚’ã•ã‚‰ã«ç°¡ç•¥åŒ–ã—ã¦ãŠå±Šã‘ã™ã‚‹(å…ƒè«–æ–‡è‡ªä½“æœ¬æ–‡ã¯3ãƒšãƒ¼ã‚¸ã—ã‹ãªã„ã—ã€å¼•ç”¨æ–‡çŒ®ã®ã‚ã¨ã«è¡¨ãŒ2ãƒšãƒ¼ã‚¸ã‚ã£ã¦ã€ãã‚Œãžã‚Œç›¸é•ç‚¹ã¨å…±é€šç‚¹ãŒã¾ã¨ã¾ã£ã¦ã„ã‚‹ã®ã§ã€ã“ã‚Œã‚’è¦‹ã‚‹ã¨éž
hiromark 2009/01/26
è¿½ã„ã‹ã‘ãã‚Œã‚“ (æ¶™)

graph

algorithm
ãƒªãƒ³ã‚¯
Link Analysis and Related Topics - Home
2008å¹´åº¦ å…ˆç«¯æƒ…å ±ç§‘å¦ç‰¹è«– II & IV ãƒªãƒ³ã‚¯è§£æžã¨å‘¨è¾ºã®è©±é¡Œ æ‹…å½“ æ–°ä¿ ä» [email protected]aist.jp æ—¥æ™‚ 2008/11/10, 11/17, 12/1, 12/8 (å…¨ 4 å›ž) - 4é™ 15:10-16:40 å ´æ‰€ æƒ…å ±æ£Ÿ L3 è¬›ç¾©å®¤ ãƒªãƒ³ã‚¯è§£æžã¯, ã‚°ãƒ©ãƒ• (ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯) ãƒ‡ãƒ¼ã‚¿ã®æ§‹é€ ã‹ã‚‰æœ‰ç”¨ãªæƒ…å ±ã‚’æŠ½å‡ºã™ã‚‹ãŸã‚ã®, ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã®ä¸€ç ”ç©¶åˆ†é‡Žã§ã™. ã“ã®è¬›ç¾©ã§ã¯ã¾ãš, ãƒªãƒ³ã‚¯è§£æžãŒå–ã‚Šæ‰±ã† 2 ç¨®é¡žã®å°ºåº¦ (é‡è¦åº¦ã¨é–¢é€£åº¦) ã«ã¤ã„ã¦è¿°ã¹, ãã‚Œãžã‚Œã®ä»£è¡¨çš„ãªè¨ˆç®—æ‰‹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™. å¾ŒåŠã§ã¯, è¿‘å¹´æ©Ÿæ¢°å¦ç¿’åˆ†é‡Žã§ç››ã‚“ã«ç ”ç©¶ã•ã‚Œã¦ã„ã‚‹ã‚«ãƒ¼ãƒãƒ«ã®ã†ã¡, ã‚°ãƒ©ãƒ•ä¸Šã®ç¯€ç‚¹ã«å¯¾ã—ã¦å®šç¾©ã•ã‚ŒãŸã‚«ãƒ¼ãƒãƒ« (ã‚°ãƒ©ãƒ•ã‚«ãƒ¼ãƒãƒ«) ã¨, ãã®ãƒªãƒ³ã‚¯è§£æžã¸ã®å¿œç”¨ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã™. ç¬¬1å›ž 11æœˆ10æ—¥ ã‚¹ãƒ©ã‚¤ãƒ‰ ç¬¬2å›ž 11æœˆ17æ—¥ ã‚¹ãƒ©ã‚¤ãƒ‰ ç¬¬3å›ž 12æœˆ1æ—¥
hiromark 2009/01/26
ã‚ã¨ã§ã˜ã£ãã‚Šèªã‚€ã€‚

graph

network

algorithm

todo
ãƒªãƒ³ã‚¯
NAIST ãƒžãƒ‹ã‚¢ãƒƒã‚¯è¬›ç¾©éŒ²: ãƒªãƒ³ã‚¯è§£æžã¨å‘¨è¾ºã®è©±é¡Œ - æ¦è”µé‡Žæ—¥è¨˜
ç´¹ä»‹ã™ã‚‹ã®ã‚’å¿˜ã‚Œã¦ã„ãŸãŒã€NAIST ã¯å†¬å¦æœŸã«ãªã‚‹ã¨ã„ã‚ã„ã‚ã¨ãƒžãƒ‹ã‚¢ãƒƒã‚¯ãªè¬›ç¾©ãŒé–‹è¬›ã•ã‚Œã‚‹ã€‚ãã®ã†ã¡ä»Šå¹´ã¯ shimbo ã•ã‚“ã®ãƒªãƒ³ã‚¯è§£æžã¨å‘¨è¾ºã®è©±é¡Œã‚’ç´¹ä»‹(ãã‚Œãžã‚Œã« PDF ãŒã‚ã‚‹)ã€‚ ãƒªãƒ³ã‚¯è§£æžã¯, ã‚°ãƒ©ãƒ• (ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯) ãƒ‡ãƒ¼ã‚¿ã®æ§‹é€ ã‹ã‚‰æœ‰ç”¨ãªæƒ…å ±ã‚’æŠ½å‡ºã™ã‚‹ãŸã‚ã®, ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã®ä¸€ç ”ç©¶åˆ†é‡Žã§ã™. ã“ã®è¬›ç¾©ã§ã¯ã¾ãš, ãƒªãƒ³ã‚¯è§£æžãŒå–ã‚Šæ‰±ã† 2 ç¨®é¡žã®å°ºåº¦ (é‡è¦åº¦ã¨é–¢é€£åº¦) ã«ã¤ã„ã¦è¿°ã¹, ãã‚Œãžã‚Œã®ä»£è¡¨çš„ãªè¨ˆç®—æ‰‹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™. å¾ŒåŠã§ã¯, è¿‘å¹´æ©Ÿæ¢°å¦ç¿’åˆ†é‡Žã§ç››ã‚“ã«ç ”ç©¶ã•ã‚Œã¦ã„ã‚‹ã‚«ãƒ¼ãƒãƒ«ã®ã†ã¡, ã‚°ãƒ©ãƒ•ä¸Šã®ç¯€ç‚¹ã«å¯¾ã—ã¦å®šç¾©ã•ã‚ŒãŸã‚«ãƒ¼ãƒãƒ«ã¨, ãã®ãƒªãƒ³ã‚¯è§£æžã¸ã®å¿œç”¨ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã™. ã¨ã„ã†ã“ã¨ã§ã€ã„ã‚ã„ã‚ãªã‚«ãƒ¼ãƒãƒ«ã«ã¤ã„ã¦å–ã‚Šä¸Šã’ã¦ãŠã‚Šã€ã‚³ãƒ³ãƒ‘ã‚¯ãƒˆã«ã¾ã¨ã¾ã£ã¦ã„ã‚‹ã®ã§ã€ã“ã®ã‚ãŸã‚Šã«èˆˆå‘³ã‚ã‚‹äººã«ãŠè–¦ã‚ã€‚ ã‚‚ã†å°‘ã—æ›¸ãã¨ã€ã¾ãšãƒªãƒ³ã‚¯è§£æžã¨ã¯ãªã«ã‹è¿°ã¹ã€é‡è¦åº¦ã¨é–¢é€£åº¦ã«ã¤ã„ã¦
hiromark 2009/01/25
ãŠã‚‚ã—ã‚ãã†ã˜ã‚ƒã‚“ï¼

computer

science

graph

network

algorithm
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸