搜索结果
找到约 11 项符合
vertices 的查询结果
STL Export a vertices/faces patch to an STL triangular mesh.This is based heavily on Bill McDonald s pre
Export a vertices/faces patch to an STL triangular mesh.This is based heavily on Bill McDonald s previous work, simply enabling his output functions for a different form of input.
JavaScript A Simplex is an immutable set of vertices
A Simplex is an immutable set of vertices
JavaScript A Triangulation on vertices (generic type V)
A Triangulation on vertices (generic type V)
软件设计/软件工程 printf(" 请输入％d个课程的代表值(<％d个字符): " ,(*G).vexnum,MAX_NAME) for(i=0 i<(*G).vexnum ++i)
printf(&quot 请输入％d个课程的代表值(<％d个字符):\n&quot ,(*G).vexnum,MAX_NAME)
for(i=0 i<(*G).vexnum ++i) /* 构造顶点向量 */
{ scanf(&quot ％s&quot ,(*G).vertices[i].data)
(*G).vertices[i].firstarc=NULL
}
printf(&quot 请输入％d个课程的学分值(<％d个字符):\n&quot ,(*G).vexnum,MAX_NAME)
fo ...
数据结构 Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree co
Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set of arcs (or edges).
编译器/解释器 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 ...
其他 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 ...
其他 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 ...
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 ...
数据结构 The task in this assignment is to implement an airline routing system. Your system should be able t
The task in this assignment is to implement an airline routing system. Your
system should be able to read in a
ight network as a graph from a le, where
airports are represented as vertices and
ights between airports are represented
as edges, take as input two airports and calculate the shortest ro ...