Location:
Search - topological so
Search list
Description: 同学做的基于贪婪策略的拓扑排序算法可视化演示程序，支持用户自己画出拓扑图，VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
Platform: |
Size: 68808 |
Author: 杨智丹 |
Hits:
Description: 课程安排，用拓扑排序实现
4、实现课程的拓扑排序。(选)（加）
问题描述：软件专业的学生要学习一系列课程，其中有些课程必须在其先修课程完成后才能学习，具体关系见下表：
课程编号 课程名称 先决条件
C1 程序设计基础 无
C2 离散数学 C1
C3 数据结构 C1，C2
C4 汇编语言 C1
C5 操作系统 C3
假设每门课程的学习时间为一学期，试为该专业的学生设计教学计划，使他们能在最短的时间内修完这些课程。-curriculum, using topological sorting achieve four to achieve the topological sorting courses. (EAC) (Canada) Problem description : software professional students to study a series of courses Some of the programs must, in its prevocational courses can be completed after the study, the specific relationship between the table below : Curriculum prerequisite for the design procedures based on C1-C2 C3 Discrete Mathematics C1 C1 data structure, C2 C1 C4 C5 assembly language operating system C3 assumptions each course of study for a semester, Examination for Professional Teaching students design plans so that they can in the shortest time got these courses.
Platform: |
Size: 9296 |
Author: lea5195444 |
Hits:
Description: 同学做的基于贪婪策略的拓扑排序算法可视化演示程序，支持用户自己画出拓扑图，VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
Platform: |
Size: 68608 |
Author: 杨智丹 |
Hits:
Description: 课程安排，用拓扑排序实现
4、实现课程的拓扑排序。(选)（加）
问题描述：软件专业的学生要学习一系列课程，其中有些课程必须在其先修课程完成后才能学习，具体关系见下表：
课程编号 课程名称 先决条件
C1 程序设计基础 无
C2 离散数学 C1
C3 数据结构 C1，C2
C4 汇编语言 C1
C5 操作系统 C3
假设每门课程的学习时间为一学期，试为该专业的学生设计教学计划，使他们能在最短的时间内修完这些课程。-curriculum, using topological sorting achieve four to achieve the topological sorting courses. (EAC) (Canada) Problem description : software professional students to study a series of courses Some of the programs must, in its prevocational courses can be completed after the study, the specific relationship between the table below : Curriculum prerequisite for the design procedures based on C1-C2 C3 Discrete Mathematics C1 C1 data structure, C2 C1 C4 C5 assembly language operating system C3 assumptions each course of study for a semester, Examination for Professional Teaching students design plans so that they can in the shortest time got these courses.
Platform: |
Size: 254976 |
Author: lea5195444 |
Hits:
Description: 课程安排，用拓扑排序实现
4、实现课程的拓扑排序。(选)（加）
问题描述：软件专业的学生要学习一系列课程，其中有些课程必须在其先修课程完成后才能学习，具体关系见下表：
课程编号 课程名称 先决条件
C1 程序设计基础 无
C2 离散数学 C1
C3 数据结构 C1，C2
C4 汇编语言 C1
C5 操作系统 C3
假设每门课程的学习时间为一学期，试为该专业的学生设计教学计划，使他们能在最短的时间内修完这些课程。 -Curriculum, using topological sorting realize 4 courses realize topological sort. (Election) (Canada) Problem Description: Software professional students to learn a series of courses, some of which courses must be completed in its prevocational curriculum in order to learn the specific relationship between the table below: Course Code Course Title prerequisite program design based on non-C1 C2 Discrete Mathematics C1C3 data structure C1, C2C4 assembly language operating system C1C5 assumption C3 for each course of study time for one semester, the students test the design of teaching programs, so that they can in the shortest time possible to complete these courses.
Platform: |
Size: 133120 |
Author: flftadnnl |
Hits:
Description: 对于一个只有顶点坐标和面片索引的三角形网格，求出一些基本的拓扑信息，如：面片的三条边索引，边的顶点索引，相邻的顶点索引，相邻的三角面片索引等等，一些很有用的三维网格数据的基本处理操作。-Only the vertex coordinates for a surface-chip index and the triangle mesh, obtained some of the basic topological information, such as: surface-chip index of the three sides, the edge of vertex index, adjacent vertex index, adjacent to the Triangle-index, etc. and so on, some very useful three-dimensional grid of the basic data handling.
Platform: |
Size: 5609472 |
Author: 曾识 |
Hits:
Description: 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下：
（1）在有向图中查找一个没有后继（或前驱）的顶点并添加到顶点表中。
（2）从图中删除该顶点和所有以该顶点为头（尾）的弧。
-The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algorithm can find the order of a topological map. The idea of an algorithm as follows: (1) in the directed graph to find a follow-up (or precursor) is added to the vertex and vertex table. (2) from the plan to remove all of the vertex and the vertex for the head (tail) of the arc.
Platform: |
Size: 1024 |
Author: zong |
Hits:
Description: 实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !
Platform: |
Size: 5120 |
Author: qq546703 |
Hits:
Description: Particle swarm optimization (PSO) is a population based stochastic optimization technique developed by Dr. Eberhart and Dr. Kennedy in 1995, inspired by social behavior of bird flocking or fish schooling. Each particle keeps track of its coordinates in the problem space which are associated with the best solution (fitness) it has achieved so far. (The fitness value is also stored.)
This value is called pbest. Another "best" value that is tracked by the particle swarm optimizer is the best value, obtained so far by any particle in the neighbors of the particle. This location is called lbest. when a particle takes all the population as its topological neighbors, the best value is a global best and is called gbest. Following is the steps of PSO:
Platform: |
Size: 1024 |
Author: BBB |
Hits:
Description: 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth traversal traverse to attempt to grasp the basis of some commonly used algorithms, such as minimum spanning tree, topological sorting, shortest path and so on.
Platform: |
Size: 253952 |
Author: 胡顶豪 |
Hits:
Description: 数据结构教程拓扑排序资料Topological sort information data structure tutorial
-Data structure tutorial topological sorting information Topological sort information data structure tutorial
Platform: |
Size: 111616 |
Author: 7b |
Hits:
Description: 目前三角网是进行精细地形表达最好和最常用的方法，因此本文讨论利用三角网法来建立露天矿的精细DEM模型。由于露天矿复杂特殊的地形特征，在建模过程中应充分考虑相应的约束条件，否则会出现台阶被削平等现象。构建不规则三角网的方法可分为分而治之算法、逐点插入算法和三角网生长算法。各种算法各具优缺点，结合矿区的实际情况，本文采用一次性约束三角网生成算法，经过空间数据提取、拓扑关系建立以及空间索引建立，最终建立起边界约束线以内的约束不规则三角网。-At present, triangulated irregular net is the best method of fine landform expression, so the paper discusses applying triangulated irregular net to establish fine DEM of open-pit. Because of complicated landform characteristic, corresponding constraint condition should be considered in building model process, otherwise it will appear phenomenon that flight of steps is cut. The method of triangulated irregular net establishment is detachable for divide and conquer algorithm, piecemeal intervene in algorithm and triangle net growth algorithm. The various algorithm has excellence and shortcoming respectively, combined with the mining area actual situation, this paper adopt the constrained triangulated irregular net once generation algorithm, through spatial data extraction, topological relations generation and spatial indexing generation, constrained triangulated irregular net is generated within boundary line at last.
Platform: |
Size: 330752 |
Author: suixin |
Hits:
Description: 实现了所选课程的正确排序，由于部分课程有先修课程，因此用到了拓扑排序的知识。-Selected the correct course to achieve the sort, as some courses have pre-course, so use a topological sort of knowledge.
Platform: |
Size: 4741120 |
Author: 王希 |
Hits:
Description: 提出并实现了基于简单网络管理协议( SNMP)的大型异构IP网络拓扑发现方法,该方法包括代理发现、拓扑信息探测和拓扑信息分析三个步骤。对代理发现中的探测报文构造、去除冗余信息、信息分析算法以及非转发设备信息利用等关键问题进行了讨论,针对探测时遇到的路由器间歇性不响应、路由器过长时间不响应和探测目标为子网络号等问题进行了分析并给出了解决方案。实现结果表明,该方法可以高效地获取较为丰富的拓扑信息,与traceroute路径探测结合使用,可以极大地提高拓扑发现结果的完整性-Including agent discovery, topology information detection and topological analysis of information in three steps. The agent was found in the detection message structure, remove redundant information, information analysis algorithm and a forwarding device information utilization and other key issues are discussed, aiming at the detection when the router, router in response to intermittent not long time no response and target detection for the network number and so on are analyzed and the solutions are given. Implementation results show that, the method can effectively obtain more abundant topology information, and traceroute path detection used in combination, can greatly improve the integrity of the topology discovery
Platform: |
Size: 159744 |
Author: cctv |
Hits:
Description: 实现的基本方法
拓扑排序方法如下:
(1)从有向图中选择一个没有前驱(即入度为0)的顶点并且输出它.
(2)从网中删去该顶点,并且删去从该顶点发出的全部有向边.
(3)重复上述两步,直到剩余的网中不再存在没有前趋的顶点为止.-The basic method to achieve topological sorting method is as follows: (a) selecting from a directed graph without a precursor (ie degree is 0) vertices and outputs it. (2) deleting the vertices from the network, and by deleting from the all issued vertex directed edges. (3) Repeat the above two steps until the remaining network no longer exists predecessor vertex so far.
Platform: |
Size: 17408 |
Author: 周鑫恺 |
Hits:
Description: 知乎爬虫
此项目的功能是爬取知乎用户信息以及人际拓扑关系，爬虫框架使用scrapy，数据存储使用mongo，下载这些数据感觉也没什么用，就当为大家学习scrapy提供一个例子吧(The function of this project is to crawl and understand user information and interpersonal topological relations. The crawler framework uses scrapy, data storage and Mongo to download these data. It doesn't feel good to use these data. So we can provide an example for you to learn scrapy)
Platform: |
Size: 1670144 |
Author: zyt1998
|
Hits: