搜索资源列表
bibao
- 闭包传递法的一个函数以及一个求最大生成树的函数,用于模糊聚类分析(matlab)
bibao
- 闭包传递法的一个函数以及一个求最大生成树的函数,用于模糊聚类分析(matlab)-Closure of the transfer method for a function and a function of the maximum spanning tree for the fuzzy cluster analysis (matlab)
relation
- 判断一个关系矩阵是否有传递性，对称性，自反性，非自反性，方对称性，非对称性，并计算传递闭包，自反闭包，对称闭包，若是等价关系，则输出等家里-Determine whether there is a relationship matrix transitivity, symmetry, reflexivity, non-reflexive, square symmetry, asymmetry, and calculate the tra
warshall
- 计算它的自反闭包，对称闭包，传递闭包使R+和warshall算法 -Calculate its reflexive closure, symmetric closure, transitive closure algorithms make R+ and warshall
chuandibibao
- 给定n个城市之间的有向图，每条边是以字母标示的，输出在每条可行线路u->v中，其所经过的每一段线路的相同的字母。经典的传递闭包问题。-There are n cities between a given directed graph, each edge is marked letters in each line feasible u-> v, and they go through the same section of
FCM-based-on-equal-relation
- FCM的一种实现方式基于模糊等价关系的聚类，需要建立传递闭包，适合初学模糊理论的同学练习。-a relation for clustering based on fuzzy equation ,which need formte pass relation ,it is useful for student who is learning FCM
R-closure
- 用C语言编写程序，实现用Warshall算法解决关系R的传递闭包问题-Write a program in C language, implemented by Warshall algorithm to solve relationship problems transitive closure R
ProjetDeGraphe1.3
- 课程设计作业，图论简单理论的实现，例如传递闭包等，其中很多注释是法语。-Curriculum design, graph theory, the theory of simple realization, such as transitive closure, etc., many of which comment is French.
chuandibibao
- 给定n个城市之间的有向图，每条边是以字母标示的，输出在每条可行线路u-> v中，其所经过的每一段线路的相同的字母。经典的传递闭包问题。-There are n cities between a given directed graph, each edge is marked letters in each line feasible u-> v, and they go through the same section of
F_JIDtjl
- 模糊聚类分析动态聚类图，R模糊相似矩阵求传递闭包-Fuzzy cluster analysis of dynamic clustering diagram, R fuzzy similar matrix transitive closure of
floyd-knapsack
- floyd knapsack Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为O(N3)，空间复杂度为O(N2)。 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的
Floyd
- 弗洛伊德算法是解决任意两点间的最短路径的一种算法，可以正确处理有向图或有向图或负权（但不可存在负权回路)的最短路径问题，同时也被用于计算有向图的传递闭包。(Floyd algorithm is an algorithm to solve the shortest path between any two points, can correctly handle the directed graph or directed graph o
bloxpy
- 离散数学中关系的闭包运算,包括自反闭包,对称闭包,传递闭包()
gdkhuie
- 离散数学中关系的闭包运算,包括自反闭包,对称闭包,传递闭包()