搜索结果
找到约 21 项符合
vertex 的查询结果
按分类筛选
matlab例程 This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometr
This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral, and coordinate bisection. It also has routines to generate recursive multiway partitions, vertex separators, and nested dissection orderings and it has some sample me ...
游戏 现在市面上流行的3D游戏画面越来越炫目
现在市面上流行的3D游戏画面越来越炫目，不过也有一些为了营造一种特殊的效果而使用了卡通渲染技术，比如PC游戏中的《杀手XIII》，《忍者神龟》；PS2游戏中的《真红之泪》，《犬夜叉》等等。这些游戏的画面看上去很像漫画，感觉比较有趣。下面就介绍一种简单的实现方法。
所谓用卡通渲染技术绘制的三维物体一般都有两个明 ...
数值算法/人工智能 北京大学ACM题 Here is a geometric problem. You have an angle and some squares in the first quadrant of
北京大学ACM题
Here is a geometric problem. You have an angle and some squares in the first quadrant of the plane rectangular coordinates. The vertex of the angle is fixed on the origin O of the coordinates, and both of its radial lines are specified by the input. The sizes of the squares are also s ...
VHDL/FPGA/Verilog xilinx官方PCIcore 有详细说明文档
xilinx官方PCIcore 有详细说明文档，支持Spartan，Vertex
编译器/解释器 c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths ...
其他 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 ...
Java编程 Specification File adjacencyListGragh class GeneralGraph: use adjacency list to implement the gr
Specification File
adjacencyListGragh
class GeneralGraph:
use adjacency list to implement the graph which data structure is vector
Construct methods:
* public GeneralGraph():
contain an empty vector store the vertex and a boolean determines whether graph is directed or not, defaulted is undirecte ...
数据结构 13、堆 MinHeap.h test.cpp 14、哈夫曼树 BinTreeNode.h BinaryTree.h MinHeap.h Huffman.h Test.
13、堆
MinHeap.h
test.cpp
14、哈夫曼树
BinTreeNode.h
BinaryTree.h
MinHeap.h
Huffman.h
Test.cpp
15、树 164
QueueNode.h
LinkQueue.h
TreeNode.h
Tree.h 170
test.cpp
16、B+树
BTreeNode.h
BTree.h 192
test.cpp
17、图 217
MinHeap.h
Edge.h 222
Vertex.h
Graph.h 224
test.cpp
18、排序
Data.h ...
JavaScript Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test c
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The n ...
Matlab Matlab 画三维立体图形
Matlab 画三维立体图形
The aim of geom3d library is to handle and visualize 3D geometric primitives
such as points, lines, planes, polyhedra... It provides low-level functions
for manipulating 3D geometric primitives, making easier the development of more
complex geometric algorithms.  &nbs ...