搜索:vertex
找到约 21 项符合「vertex」的查询结果
结果 21
https://www.eeworm.com/dl/694/325526.html
并行计算
顶点倒塌(Vertex Collapse)算法中
顶点倒塌(Vertex Collapse)算法中,一开始图中的N个顶点看作N个孤立的超顶点(Super Vertex),算法运行中,有边连通的超顶点相继合并,直到形成最后的整个连通分量。每个顶点属于且仅属于一个超顶点,超顶点中标号最小者称为该超顶点的根。 ...
https://www.eeworm.com/dl/694/434118.html
并行计算
Fanatstic, outstanding VGA driver for vertex two.This is the bomb.
Fanatstic, outstanding VGA driver for vertex two.This is the bomb.
https://www.eeworm.com/dl/cadence/ebook/460416.html
电子书籍
The book describes so called shader technology in computer graphics pipeline. vertex, pixel shaders,
The book describes so called shader technology in computer graphics pipeline. vertex, pixel shaders, registers, effects and aspects of shaders.
https://www.eeworm.com/dl/641/480519.html
数学计算
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex
https://www.eeworm.com/dl/686/184632.html
VC书籍
这是一本有关图形渲染得书。是学习Vertex shader和Pixel shader编程的很好的参考书。
这是一本有关图形渲染得书。是学习Vertex shader和Pixel shader编程的很好的参考书。
https://www.eeworm.com/dl/534/133429.html
其他
图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph=( V, E ).使用拓扑排序的算法.
图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph=( V, E ).使用拓扑排序的算法.
https://www.eeworm.com/dl/663/350770.html
VHDL/FPGA/Verilog
xilinx官方PCIcore 有详细说明文档
xilinx官方PCIcore 有详细说明文档,支持Spartan,Vertex
https://www.eeworm.com/dl/534/425107.html
其他
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 disco ...
https://www.eeworm.com/dl/515706.html
手册
Xilinx 主流芯片选型指导
Xilinx 主流芯片选型指导,主要讲述了Spartan系列和vertex系列的优缺点和选用偏好
https://www.eeworm.com/dl/633/441581.html
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, de ...