Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

¹òÇóÓÃUSBÉãÏñÍ·»ñÈ¡²¢±£´æÍ¼ÏñµÄc»òc++´úÂë

ÒªÇóÒ»¶¨²»ÒªÓÃMFC×ö£¬¾ÍÊÇÒ»°ãµÄMAIN£¨£©ÄÇÖÖ¡£
ÒªÇó¾ÍÊÇÉãÏñÍ·´ò¿ª£¬È»ºóÒ»Ö±¿ª×Å£¬È»ºó±£´æÒ»Ö¡Í¼ÏñΪ.BMP¸ñʽ£¬È»ºó½áÊø¾Í¿ÉÒÔÁË¡­¡­ 

¶÷£¬²î²»¶à¾ÍÑù~¸÷λ´ó´ó°ï°ïæ~

»¹ÓУ¬ÎÒΪʲô´ÓÍøÉÏϵijÌÐò»áÔÚ#include "cv.h"Õâ¾ä±àÒëʱ£¬±¨100¶à¸ö´í°¡£¿
WINDOWSÓÐAPI¿ÉÒÔʹÓÃ,¾ßÌåGOOGLEÒ»ÏÂ

µ÷ÓÃÇý¶¯ÌṩµÄAPIº¯Êý¡£
Ó¦¸Ã·Ç³£¼òµ¥¡£


°ï¶¥



ÒýÓÃ
µ÷ÓÃÇý¶¯ÌṩµÄAPIº¯Êý¡£
Ó¦¸Ã·Ç³£¼òµ¥¡£


ÎÒÒ²Ïë¿´¼òµ¥µÄ³ÌÐò¡£
{{


Ïà¹ØÎÊ´ð£º

CµÄѧϰ;¾¶ - C/C++ / ÐÂÊÖÀÖÔ°

ÎÒֻѧ¹ýÇ廪À¶·âÃæµÄCÓïÑÔ»ù´¡£¬Ïë¸üÉîÈëµÄѧϰ£¬¸Ã¿´Ê²Ã´ÊéºÃ£¿
C Primer Plus
C³ÌÐòÉè¼ÆÓïÑÔ(µÚ2°æÐ°æ)
CÓïÑÔ³ÌÐòÉè¼Æ_ÏÖ´ú·½·¨
CÓïÑԲο¼ÊÖ²áµÚÎå°æ
CÓïÑÔ´óÈ«
CºÍÖ¸Õë
CÏÝÚåÓëȱÏÝ
Cר¼Ò±à³Ì

......

C/C++/MFCȺ - VC/MFC / ·Ç¼¼ÊõÀà

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

C/C++/MFCȺ - C/C++ / ·Ç¼¼ÊõÇø

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ