搜索：start - 虫虫下载站

其他  Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a pr

Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be ...

https://www.eeworm.com/dl/534/425107.html

下载: 193

查看: 1059

Java书籍  Learn to build applications with Jakarta Struts, the most popular JSP development framework. Struts

Learn to build applications with Jakarta Struts, the most popular JSP development framework. Struts Kick Start is a "hands-on" book filled with sample applications and code snippets you can reuse, and in-depth coverage of new features in Struts 1.1. If you are looking for a practical book that "show ...

https://www.eeworm.com/dl/656/425131.html

下载: 118

查看: 1089

其他嵌入式/单片机内容  51 single-chip implementation using a simple four-way program design Answer A total of single-c

51 single-chip implementation using a simple four-way program design Answer A total of single-chip Quick Start

https://www.eeworm.com/dl/687/430244.html

下载: 119

查看: 1098

通讯编程文档  Java has become a confusing world. Five years ago, there were few decisions to make once you start

Java has become a confusing world. Five years ago, there were few decisions to make once you started programming in Java—you used AWT for graphical user interfaces, sockets for network programming, and hacked together everything else you needed. Since then, though, the APIs available for the Jav ...

https://www.eeworm.com/dl/646/432566.html

下载: 117

查看: 1057

汇编语言  Tiny Planet is small device connected to a GSM cell phone. When the mobile receives a predefined SMS

Tiny Planet is small device connected to a GSM cell phone. When the mobile receives a predefined SMS (text message), like "Activate burglar alarm" or "Start backup pump", the circuit automatically recognizes it as a command, and switches the output port accordingly. Besides switching the port on or ...

https://www.eeworm.com/dl/644/441161.html

下载: 77

查看: 1068

Java编程  在J2ME中实现虚拟代理

在J2ME中实现虚拟代理，然后过滤user-agent ，用于突破广东移动等的cmwap限制使用方法，启动后将相应软件（如Opera）的代理设成localhost 8080，即可-J2ME virtual agents, then filter user-agent, Guangdong Mobile breakthrough for the restrictions on the use of SMS, will start corresponding software (such as th ...

https://www.eeworm.com/dl/633/443307.html

下载: 138

查看: 1044

CA认证  Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2

Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key M ...

https://www.eeworm.com/dl/640/444418.html

下载: 143

查看: 1070

VC书籍  This book introduces the powerful programming tools provided in your Microsoft Visual C++ compiler p

This book introduces the powerful programming tools provided in your Microsoft Visual C++ compiler package. These include the compiler, debugger, and various Windows 95, 98, and NT development tools. This book compliments your Microsoft reference manuals and online help to provide a quick start with ...

https://www.eeworm.com/dl/686/450018.html

下载: 26

查看: 1030

其他  The C++ Cookbook will make your path to mastery much shorter. This practical, problem-solving guide

The C++ Cookbook will make your path to mastery much shorter. This practical, problem-solving guide is ideal if you re an engineer, programmer, or researcher writing an application for one of the legions of platforms on which C++ runs. The algorithms provided in C++ Cookbook will jump-start your dev ...

https://www.eeworm.com/dl/534/450027.html

下载: 101

查看: 1062

数据结构  迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your prog ...

https://www.eeworm.com/dl/654/450069.html

下载: 163

查看: 1077

搜索结果

按分类筛选