Search - graph - CodeBus

Search - graph - List

[CSharp] EULER1 DL : 0: Euler 回路问题 .问题描述：对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务：对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入：由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。-Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.
Date : 2008-10-13 Size : 60.57kb User : 无翼
[CSharp] daiquanwuxiangtu DL : 0: 带权无向图，是我修改别人的。自己看看能不能用-weighted undirected graph, I have altered others. See for yourself can use
Date : 2008-10-13 Size : 1000byte User : 刘莽
[CSharp] up3 DL : 0: 本程序为“有向图的遍历及运算”，非常方便使用，希望大家能够喜欢。-the procedures as "directed graph traversal and calculations," is very convenient to use and I hope we can like.
Date : 2008-10-13 Size : 29.08kb User : 苏杰
[CSharp] HuffmenTree DL : 0: 哈夫曼编/译码器实现概要设计中定义的所有数据类型，对每个操作只需要写出伪码算法；对主程序和其他模块也都需要写出伪码算法(伪码算法达到的详细程度建议为：按照伪码算法可以在计算机键盘直接输入高级程序设计语言程序)；画出函数的调用关系图。-Huffman encoder / decoder design outline to achieve the definition of all data types, for each operation only needs to write pseudo-code algorithms; the main program and other modules are also required to write pseudo-code algorithms (pseudo-code algorithms to achieve the level of detail recommendations : According to pseudo-code algorithms in the computer keyboard can be imported directly Senior Program Design Language Program); paint function call graph.
Date : 2008-10-13 Size : 9.7kb User : 季舟
[CSharp] graph DL : 0: 关于数据结构图的基本操作，有构建，删除节点，添加节点，输入输出等
Date : 2008-10-13 Size : 1.28kb User : 王忠兰
[CSharp] QuickGraph_src DL : 1: Boost Graph Library的C#实现,有很多图论算法。-Boost Graph Library of C#, there are many graph algorithm.
Date : 2008-10-13 Size : 232.69kb User : 杨波
[CSharp] QuickGraph_src DL : 0: Boost Graph Library的C#实现,有很多图论算法。-Boost Graph Library of C#, there are many graph algorithm.
Date : 2026-01-01 Size : 232kb User : 杨波
[CSharp] EULER1 DL : 0: Euler 回路问题 .问题描述：对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务：对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入：由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。-Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.
Date : 2026-01-01 Size : 60kb User : 无翼
[CSharp] daiquanwuxiangtu DL : 0: 带权无向图，是我修改别人的。自己看看能不能用-weighted undirected graph, I have altered others. See for yourself can use
Date : 2026-01-01 Size : 1kb User : 刘莽
[CSharp] up3 DL : 0: 本程序为“有向图的遍历及运算”，非常方便使用，希望大家能够喜欢。-the procedures as "directed graph traversal and calculations," is very convenient to use and I hope we can like.
Date : 2026-01-01 Size : 29kb User : 苏杰
[CSharp] HuffmenTree DL : 0: 哈夫曼编/译码器实现概要设计中定义的所有数据类型，对每个操作只需要写出伪码算法；对主程序和其他模块也都需要写出伪码算法(伪码算法达到的详细程度建议为：按照伪码算法可以在计算机键盘直接输入高级程序设计语言程序)；画出函数的调用关系图。-Huffman encoder/decoder design outline to achieve the definition of all data types, for each operation only needs to write pseudo-code algorithms; the main program and other modules are also required to write pseudo-code algorithms (pseudo-code algorithms to achieve the level of detail recommendations : According to pseudo-code algorithms in the computer keyboard can be imported directly Senior Program Design Language Program); paint function call graph.
Date : 2026-01-01 Size : 9kb User : 季舟
[CSharp] cvery_35314740 DL : 0: VB下鹰眼图的实现 VB下鹰眼图的实现-VB Graph realize under the Eagle Eye Eagle Eye diagram under VB realize
Date : 2026-01-01 Size : 12kb User :
[CSharp] FibonacciHeap DL : 0: FibonacciHeap是一种优先队列，就平均而言有很好的性能，所以在一些图论算法中可以用来作改进算法的数据结构，尤其是那些稀疏图，总之是很好的工具。下面以设计者的角度简单描述我设计它的过程和思路。-FibonacciHeap is a priority queue, on average, have a good performance, so in a number of graph theory algorithms can be used to improve the algorithm for data structure, especially those sparse map, as long as it is a very good tool. Below a brief description of the designer s point of view I have devised the process and thinking it.
Date : 2026-01-01 Size : 4kb User : 哈哈哈
[CSharp] Telerik.WinControls.RadChart DL : 0: r.a.d.chart是一个完全可自定义的图表控件，可以显示复杂的图形数据，该产品提供4种基本类型的图表 – 饼状图（Pie）, 条状图（Bar）, 线形图（Line）,和范围图（Area），每一个都可以被充分的定制，r.a.d.chart能够帮助您更加人性化地表现和利于领会复杂的数据 -radchart is a completely customizable chart control, can display complex graphics data, the product provides four kinds of basic types of charts- Pie Chart (Pie), Bar (Bar), line graph (Line), and the scope of Map (Area), each one can be fully customized, radchart can help you more humane and beneficial to understand the performance of complex data
Date : 2026-01-01 Size : 534kb User : ljh
[CSharp] c DL : 0: 采用邻接矩阵表示法创建有向图，是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c
Date : 2026-01-01 Size : 1kb User : huliang
[CSharp] graph.project DL : 0: A program to graph printing. You choose connections between apexes. Source code and binaries
Date : 2026-01-01 Size : 53kb User : Habesy
[CSharp] drawData DL : 0: 折线图、饼形图、柱形图的源代码，用于各种数据的直观统计、分析-Line charts, pie charts, bar graph of the source code for a variety of visual data, statistics, analysis, etc.
Date : 2026-01-01 Size : 46kb User : 王石通
[CSharp] sales-graph DL : 0: 本程序是一个公司的销售业绩曲线图，里面有详细的注释，解释怎样标记文字图框，背景等。-This program is a graph of the company' s sales performance, which has detailed notes explaining how the label text frame, background.
Date : 2026-01-01 Size : 106kb User : 周海壮
[CSharp] binary-graph DL : 0: 分享一个二分图的例子，里面的二分图是使用了深度遍历的方法，适合初学者学习-Searching of binary graph
Date : 2026-01-01 Size : 33kb User : xu
[CSharp] Graph DL : 0: 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity.
Date : 2026-01-01 Size : 1.03mb User : 易新宇

« 12 3 4 5 6 7 »