Search - graph - CodeBus

Search - graph - List

[Algorithm] 现代统计学与ＳＡＳ应用 DL : 0: 本书共分６篇，第１篇统计学基础知识与ＳＡＳ软件应用技巧，介绍了统计学的基本概念和学习方法、试验设计入门、统计描述、ＳＡＳ软件应用入门、编写ＳＡＳ实用程序的技巧、单变量统计分析和利用SAS／GRAPH模块绘制常用统计图的方法。第２篇试验设计与定量资料的统计分析，介绍了与ｔ检验、非参数检验和各种方差分析有关的试验设计和数据处理方法。第３篇试验设计与定性资料的统计分析，介绍了处理二维及高维列联表资料的各种统计分析方法，包括卡方检验、Fisher的精确检验、典型相关分析、logistic回归模型和对数线性模型等内容。第４篇试验设计与回归分析，介绍了回归分析的种类和选用方法、简单直线回归、多项式回归、简单曲线回归、多元线性回归、协方差分析、直接试验设计及其资料的回归分析等有关内容。第５篇生存分析，介绍了生存资料的特点、生存时间函数和生存分析方法的分类等基本概念；生存资料的非参数分析方法、ＣＯＸ模型分析方法和参数模型的回归分析方法。第６篇多元统计分析，介绍了主成分分析、因子分析、对应分析、聚类分析、判别分析、典型相关分析。-The book is divided into six, a statistically based knowledge and skills in SAS software applications, introduced the basic concepts in statistics and learning methods, experimental design entry, statistical description of SAS software application entry, to prepare SAS utility skills, single variable statistical analysis and use SAS/GRAPH mapping module commonly used statistical map. The first two experimental design and quantitative analysis of the statistical data, presented with t-test, non- parametric tests and the analysis of variance test design and data processing methods. The first three test design and qualitative information on the statistical analysis of two-dimensional processing and high-dimensional data table shown in the various statistical analysis methods, including chi
Date : 2026-01-01 Size : 725kb User : 苏吉
[Algorithm] 分支与界法 DL : 0: 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
Date : 2026-01-01 Size : 2kb User : 谢继晖
[Algorithm] 在无向完全图中寻找边不重复的汉密尔顿回路 DL : 0: 图论课程设计：在无向完全图中寻找边不重复的汉密尔顿回路-graph theory of curriculum design : no plans to seek full side will not repeat the Hamilton circuit
Date : 2026-01-01 Size : 20kb User : ch.nan
[Algorithm] graph.tar DL : 0: linux环境对二维数组画出图像。使用c语言。-linux environment on two-dimensional array of painted images. Using c language.
Date : 2026-01-01 Size : 1.01mb User : tongjiaei
[Algorithm] Kruskal DL : 0: kruskal算法，实现图的遍历最短路径查找，本人的算法设计的一次实验。-Kruskal algorithm, to achieve the shortest path graph traversal search, the algorithm I designed an experiment.
Date : 2026-01-01 Size : 226kb User : moxianwen
[Algorithm] GraphAlgori DL : 0: 图论算法中dijkstra、Floy、和最小生成树算法的实现，使用类进行封装-Graph theory algorithm dijkstra, Floy, and the minimum spanning tree algorithm, the use of encapsulation
Date : 2026-01-01 Size : 169kb User : 林立文
[Algorithm] Dijkstra DL : 0: dijkstra算法实现，即最短寻路算法。给出图（有向图或者无向图）中各点间的权值。-Dijkstra algorithm, that is, find the shortest path algorithm. Given graph (directed graph or undirected graph) between various points in the right value.
Date : 2026-01-01 Size : 1.9mb User : 宝宝
[Algorithm] graphAnalysis DL : 2: 该文件是用matlab开发的图论分析工具箱，里面有使用时的详细说明，pdf说明文档。绝对实用对于图论的研究者-The document was developed with matlab graph theory analysis toolbox, which are used when a detailed explanation, pdf documentation. Absolutely useful for researchers in graph theory
Date : 2026-01-01 Size : 62kb User : 卫立波
[Algorithm] router_calc DL : 0: 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified node (router) routing table with nodes N, N' s routing table routing by a number of components, routing is < the purpose of nodes, next hop> dual group node is one of the purpose of node N as the source node by node N can arrive (the purpose of node N are neighbor nodes) or through a neighbor node N can be indirectly Get the nodes, that is one of the next hop of a node N from home, the adoption of the neighbor may be an indirect purpose of node arrival and arrival at the destination node for the smallest cost of the path path.
Date : 2026-01-01 Size : 1kb User : luowen
[Algorithm] follow DL : 0: 资料介绍了图论算法中最重要的定理之一的最小个最大流定理-Information on the graph theory algorithm, one of the most important theorem of the minimum of maximum flow theorem
Date : 2026-01-01 Size : 36kb User : 天雨
[Algorithm] Regular_PEG DL : 1: 此程序是一个C++程序. 通过PEG算法来构造 LDPC parity-check 矩正的Tanner 图.-This is a C++ program, which is used to construct Tanner graph of LDPC codes with the famous PEG algorithm.
Date : 2026-01-01 Size : 6kb User : Jiangxueqin
[Algorithm] dijkstra DL : 0: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path
Date : 2026-01-01 Size : 1kb User : jonathan
[Algorithm] tutorial_on_spectral_clustering DL : 0: In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties, present the most common spectral clustering algorithms, and derive those algorithms from scratch by several different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.
Date : 2026-01-01 Size : 345kb User : cc
[Algorithm] graph DL : 0: This file includes the basic implementation of simulated annealing where it is used to optimize the graph coloring problem.
Date : 2026-01-01 Size : 28kb User : nancy
[Algorithm] Graph-algorithms-source DL : 0: 有关图论的大部分算法都用matlab实现了内含很多种算法，Floyd 等-source for Graph algorithms
Date : 2026-01-01 Size : 267kb User : shade
[Algorithm] CSharp_LineSegmentSplitter DL : 0: An algorithm is proposed to split a single-pixel-width connected line graph into line segments by the Hit-and-Miss transformation (HMT). Firstly, junction points and free end points are detected by a set of HMTs. Then, line segments are traced between junctions and free ends. The algorithm has been implemented in C#.
Date : 2026-01-01 Size : 108kb User : Raouf
[Algorithm] graph DL : 0: Some graph algoritm
Date : 2026-01-01 Size : 47kb User : dynamiczny
[Algorithm] Graph-theory-algorithm-Daquan DL : 0: 典型的图论算法，在图论中用的很多，11年国赛B题可以使用-Typical graph theory algorithms, graph theory using a lot of 11-year country race Problem B can use
Date : 2026-01-01 Size : 8kb User : David
[Algorithm] 06-Graph-Traversal DL : 0: graph traversal for learning c-graph traversal for learning c++
Date : 2026-01-01 Size : 377kb User : Yudha
[Algorithm] graph DL : 0: A graph generator which can creates several random graphs according to the properties indicated by user.
Date : 2026-01-01 Size : 11kb User : meh

« 12 3 4 5 6 7 8 9 10 »