Description: 本课程为本专业(独立本科段)的一门专业基础课。课程内容为：命题逻辑和一阶谓词逻辑的基本概念和基本演算；集合的概念和运算、二元关系和函数；代数运算和代数系统的基本性质、半群和群、队和域、格和布尔代数；图的基本概念、树、欧拉图和哈密顿图、平面图、图着色、赋权图、二部图等。
通过本课程的学习，使应考者有抽象思维和逻辑推理能力，掌握计算机科学技术常用的离散数学中的概念、性质和运算。
自学教材：<<离散数学>>(全国考委组编)
左孝凌 主编 经济科学出版社
参考用书 ：<<离散数学>> 左孝凌等编 上海科技出版社 1982 -he major curriculum centered (independent undergraduate paragraph) of a major foundation courses. Curriculum content are: propositional logic and first order predicate logic the basic concepts and basic calculus collection of concepts and computation, binary relations and functions algebraic operations and the basic properties of algebraic systems, semi-groups and groups, teams and domain, grid and Boolean algebra map the basic concepts, trees, Euler and Hamiltonian graph map, plan, map coloring, weighted graph, etc. Figure 2.
Through the study of the curriculum so that candidates have abstract thinking and logical reasoning ability, computer science and technology have often used the concept of discrete mathematics, nature, and computing.
Self-study materials: <<Discrete Mathematics>> (全国考委Unit)
ZUO Xiao-Ling Economic Science Press editor-in-chief
Reference book: <<Discrete Mathematics>> ZUO Xiao-Ling et al 1982, Shanghai Science and Technology P Platform: |
Size: 1098752 |
Author:alse |
Hits:
Description: 贪心算法 ；用到图结构，栈和队列来解决哈密顿回路；输出结果：路径（每条边及其权值），总和-Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum Platform: |
Size: 5120 |
Author:zhuliyan |
Hits:
Description: 给出一个完全图，给出最小哈密顿回路。顶点个数不要超过20.程序自动生成了一个完全图。也可修改输入，自己输入完全图。-Is given a complete graph is given the minimum Hamiltonian circuit. The number of vertices should not exceed 20. Program automatically generates a complete graph. Can also modify the input, your input complete graph. Platform: |
Size: 1024 |
Author:yan |
Hits:
Description: 求无向图的是否有哈密顿圈 如果有输出最大哈密顿圈-Undirected graph in order to have Hamiltonian cycle if there is the greatest Hamiltonian cycle output Platform: |
Size: 1024 |
Author:傅煜 |
Hits:
Description: 这个程序主要是应用在图论中来解决哈密顿回路问题 是比较常见的-This procedure is mainly used in graph theory to solve the Hamiltonian circuit problem is more common Platform: |
Size: 7168 |
Author:肥肥 |
Hits:
Description: 哈密顿图的判定：经过图中所有顶点一次且仅一次的回路称为哈密顿回路。具有哈密顿回路的图称为哈密顿图，-determine Hamiltonian graph : After all the vertices of a graph and only one loop is called Hamiltonian circuit. A graph that has a Hamiltonian circuit is called a Hamiltonian map, Platform: |
Size: 9216 |
Author: |
Hits:
Description: Description
给定一个完全无向带权图G，其每一条边有一个非负的整数权值。目的是要找出G的一条经过每个顶点一次且仅经过一次的回路，使回路的总权值最小。
请设计一个2-近似算法，求出近似最小的总权值，即定义最优解为C，只要输出解在[C , 2 * C]的范围内都可以“Accept”。
Input
输入第一行为一个正整数n(1 <= n <= 20)，表示G中顶点的个数。接下来n行每行包括n个整数，第i行第j个的整数表示G中第i个点到第j个点的权值。
输入保证G[i,j] = G[j,i],且G[i,i] = 0.
Output
输出一个整数表示回路的近似最小权值C*。
第二行为n个顶点序号（从0开始标号）组成的与近似解相应的哈密顿回路。-Description given a weighted graph G, each edge has a non-negative integer weights. The objective is to find G, one through each vertex once and only after the last loop, the minimum value of the total weight of the loop. Please design a 2- approximation algorithm to find the approximate minimum total weight, that is to define the optimal solution C, as long as the output solution [C, 2* C] range of the " Accept" . Input The first acts of a positive integer n (1 < = n < = 20), the number of said G vertices. The next n lines each line contains n integers, the i-th row j th integer weights in G i-th point to the j th point. Input to ensure that G [i, j] = G [j, i], and G [i, i] = 0 Output Output an integer loop approximate minimum weight value C*. The second line is composed of n vertices and serial number (from 0 label) corresponding to the approximate solution of the Hamiltonian circuit. Platform: |
Size: 1024 |
Author:liao |
Hits:
Description: 这是图论课程设计 生成哈密顿回路 有源码 报告和注释-This is the graph theory courses designed to generate a Hamiltonian circuit source report and comments Platform: |
Size: 1553408 |
Author:曾宇祥 |
Hits:
Description: 图论程序包，包括最短路的两种算法、最小生成树、匈牙利算法和哈密顿问题的智能算法。-Graph Theory package, including the shortest of the two algorithms, minimum spanning tree, the Hungarian algorithm and Hamiltonian problem intelligent algorithm. Platform: |
Size: 21677056 |
Author:qian |
Hits:
Description: 由c语言编程，在window下运行，为无向图，先读入两个数据，第一个数据为点的个数，第二个数据为边的个数。此后依次输入哪两个点之前连线，即完成无向图。之后程序会输出0和1,0代表不存在哈密顿回路，1代表存在哈密顿回路(Programming by C language, run under window, for undirected graph, read two data first, the first data is the number of points, the second data is the number of edges. Then, which two points are connected in advance to complete the undirected graph. After that, the program outputs 0 and 1,0 representing the Hamiltonian loop, and 1 represents the Hamiltonian circuit) Platform: |
Size: 19456 |
Author:晓&风
|
Hits:
Search - Hamiltonian graph