搜索结果

找到约 249 项符合 given 的查询结果

Java书籍 Learn JSP from given sample tutorials

Learn JSP from given sample tutorials
https://www.eeworm.com/dl/656/423754.html
下载: 83
查看: 1010

其他书籍 An introduction to some of the key ideas in computer graphics is given. Modeling, 2D and 3D viewing,

An introduction to some of the key ideas in computer graphics is given. Modeling, 2D and 3D viewing, transformations and related ideas from linear algebra are presented.
https://www.eeworm.com/dl/542/424422.html
下载: 20
查看: 1045

其他 this program is to layer the given image by natural cutting developed by using c

this program is to layer the given image by natural cutting developed by using c
https://www.eeworm.com/dl/534/424538.html
下载: 97
查看: 1043

其他 Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undire

Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency list.
https://www.eeworm.com/dl/534/425102.html
下载: 146
查看: 1057

其他 Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a

Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the ...
https://www.eeworm.com/dl/534/425105.html
下载: 154
查看: 1036

其他 In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights o

In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out ...
https://www.eeworm.com/dl/534/425106.html
下载: 121
查看: 1061

其他 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书籍 RSA algorithm implementation is given

RSA algorithm implementation is given
https://www.eeworm.com/dl/656/425865.html
下载: 190
查看: 1022

DSP编程 TMS6713b receiving by McBSP & EDMA(with reconfiguration of the port depending on taken given) excuse

TMS6713b receiving by McBSP & EDMA(with reconfiguration of the port depending on taken given) excuse me for my english
https://www.eeworm.com/dl/516/426717.html
下载: 75
查看: 1043

软件设计/软件工程 You will recieve a Standard Grade for completion of this Extra credit will be given for a more crea

You will recieve a Standard Grade for completion of this Extra credit will be given for a more creative approach to the problem, either minimum amount of code, an additional display of seating beyond just the boarding pass, etc
https://www.eeworm.com/dl/684/427485.html
下载: 164
查看: 1043