| ¾Ë°í¸®Áò :: functional :: bfs. ³ÐÀº °Ë»ö ¾Ë°í¸®Áò¿¡ ´ëÇÑ ±â´ÉÀû Á¢±Ù¹ý |
Áö±Ý ´Ù¿î·Îµå |
¾Ë°í¸®Áò :: functional :: bfs. ¼øÀ§ ¹× ¿ä¾à
- ƯÇã:
- Perl Artistic License
- °Ô½ÃÀÚ À̸§:
- Colin Wetherbee
- °Ô½ÃÀÚ À¥»çÀÌÆ®:
- http://search.cpan.org/~cww/
¾Ë°í¸®Áò :: functional :: bfs. ű×
¾Ë°í¸®Áò :: functional :: bfs. ¼³¸í
algorithm :: functional :: bfs´Â ³ÐÀº °Ë»ö ¾Ë°í¸®Áò¿¡ ´ëÇÑ ±â´ÉÀû Á¢±Ù ¹æ½ÄÀÔ´Ï´Ù.ÀÌ ±¸ÇöÀº ¼øȯ ¹× acyclic ±×·¡ÇÁ¸¦ Áö¿øÇÏÁö¸¸ ¿¡Áö ¶Ç´Â Á¤Á¡ °¡ÁßÄ¡¸¦ Áö¿øÇÏÁö ¾Ê½À´Ï´Ù. ½Ä ³ëÇÁ »ç¿ë ¾Ë°í¸®Áò :: functional :: bfs; # °³Ã¼¸¦ ¸¸µì´Ï´Ù. $ bfs = algorithm :: functional :: bfs-> new (adjacent_nodes_func => $ some_func, victory_func => $ some_other_func); # ½ÂÁ¡ Á¶°ÇÀ» ÃæÁ·½ÃÅ°´Â ³ëµå # ½ÃÀÛ ³ëµå¿¡¼ ½ÃÀÛ ³ëµåÀÇ ¸ðµç °æ·ÎÀÇ ¸ñ·Ï (Ref)À» °¡Á®¿É´Ï´Ù. MY $ ROUTES_REF = $ BFS-> °Ë»ö ($ start_node); Á¦Ç°ÀÇ È¨ÆäÀÌÁö
¾Ë°í¸®Áò :: functional :: bfs. °ü·Ã ¼ÒÇÁÆ®¿þ¾î