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.
標簽： triangular vertices McDonald heavily
上傳時間： 2014-01-12
上傳用戶：lindor
A Simplex is an immutable set of vertices
標簽： immutable vertices Simplex set
上傳時間： 2014-01-16
上傳用戶：CHINA526
A Triangulation on vertices (generic type V)
標簽： Triangulation vertices generic type
上傳時間： 2013-12-20
上傳用戶：jyycc
printf(" 請輸入％d個課程的代表值(<％d個字符):\n" ,(*G).vexnum,MAX_NAME) for(i=0 i<(*G).vexnum ++i) /* 構造頂點向量 */ { scanf(" ％s" ,(*G).vertices[i].data) (*G).vertices[i].firstarc=NULL } printf(" 請輸入％d個課程的學分值(<％d個字符):\n" ,(*G).vexnum,MAX_NAME) for(i=0 i<(*G).vexnum ++i) /* 構造頂點向量 */ {scanf(" ％s" ,(*G).verticestwo[i].data) } printf(&quo
標簽： vexnum quot MAX_NAME printf
上傳時間： 2016-08-15
上傳用戶：Avoid98
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).
標簽： hierarchical representing structures natural
上傳時間： 2016-12-22
上傳用戶：siguazgb
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. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
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 shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標簽： Multiplicative undirected Shortest measured
上傳時間： 2017-04-08
上傳用戶：邶刖
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 the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標簽： optimizing different the shortest
上傳時間： 2014-10-25
上傳用戶：1159797854
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 nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標簽： Implementation calculates algorithm Edmonds
上傳時間： 2014-01-04
上傳用戶：kiklkook
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 route (ie path) between them.
標簽： system assignment implement airline
上傳時間： 2017-09-07
上傳用戶：kiklkook
