中文版
Code/Resource
- Windows Develop
- Linux-Unix program
- Internet-Socket-Network
- Web Server
- Browser Client
- Ftp Server
- Ftp Client
- Browser Plugins
- Proxy Server
- Email Server
- Email Client
- WEB Mail
- Firewall-Security
- Telnet Server
- Telnet Client
- ICQ-IM-Chat
- Search Engine
- Sniffer Package capture
- Remote Control
- xml-soap-webservice
- P2P
- WEB(ASP,PHP,...)
- TCP/IP Stack
- SNMP
- Grid Computing
- SilverLight
- DNS
- Cluster Service
- Network Security
- Communication-Mobile
- Game Program
- Editor
- Multimedia program
- Graph program
- Compiler program
- Compress-Decompress algrithms
- Crypt_Decrypt algrithms
- Mathimatics-Numerical algorithms
- MultiLanguage
- Disk/Storage
- Java Develop
- assembly language
- Applications
- Other systems
- Database system
- Embeded-SCM Develop
- FlashMX/Flex
- source in ebook
- Delphi VCL
- OS Develop
- MiddleWare
- MPI
- MacOS develop
- LabView
- ELanguage
- Software/Tools
- E-Books
- Artical/Document
matching.c
Package: leda.tar.gz [view]
Upload User: gzelex
Upload Date: 2007-01-07
Package Size: 707k
Code Size: 1k
Category:
Mathimatics-Numerical algorithms
Development Platform:
MultiPlatform
- #include <LEDA/graph_edit.h>
- #include <LEDA/graph_alg.h>
- main()
- {
- GRAPH<point,int> G;
- window W;
- edge e;
- W.set_line_width(1);
- W.set_node_width(12);
- graph_edit(W,G,false);
- for(;;)
- {
- list<edge> L = MAX_CARD_MATCHING(G);
- // show matching
- W.set_line_width(5);
- forall(e,L) W.draw_edge(G[source(e)],G[target(e)]);
- W.message("MAX_CARD_MATCHING");
- W.message("(press left button to return to graph edit)");
- if (W.read_mouse() != 1) break;
- W.del_messages();
- // restore picture
- forall(e,L) W.draw_edge(G[source(e)],G[target(e)],white);
- W.set_line_width(1);
- forall(e,L) W.draw_edge(G[source(e)],G[target(e)]);
- graph_edit(W,G,false,false); // 2nd false: do not clear window
- }
- return 0;
- }
