码迷,mamicode.com
首页 >  
搜索关键字:directed    ( 315个结果
JAVA邻接表实现拓扑排序
由于一直不适用邻接表 ,现在先贴一段使用邻接矩阵实现图的拓扑排序以及判断有无回路的问题。自己做的图。将就看吧。package TopSort;import java.util.LinkedList;import java.util.Scanner;/*拓扑序列:对一个有向无环图(Directed A...
分类:编程语言   时间:2015-11-22 00:17:02    阅读次数:229
HDU5195 线段树+拓扑
DZY Loves Topological SortingProblem DescriptionA topological sort or topological ordering of a directed graph is a linear ordering of its vertices su...
分类:其他好文   时间:2015-11-10 20:55:05    阅读次数:257
HDU 4635 —— Strongly connected——————【 强连通、最多加多少边仍不强连通】
Strongly connectedTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4635DescriptionGive a simple directed grap...
分类:其他好文   时间:2015-11-06 20:48:32    阅读次数:248
【操作系统】进程管理
进程管理进程的基本概念程序的顺序执行及其特征程序的顺序执行:仅当前一操作(程序段)执行完后,才能执行后续操作。程序顺序执行时的特征:顺序性,封闭性,可再见性。前趋图前趋图(Precedence Graph)是一个有向无循环图,记为DAG(Directed Acycilc Graph),用于描述进程之...
分类:系统相关   时间:2015-11-02 17:25:37    阅读次数:414
dataStructure@ Find if there is a path between two vertices in a directed graph
Given a Directed Graph and two vertices in it, check whether there is a path from the first given vertex to second.For example, in the following graph...
分类:其他好文   时间:2015-10-23 20:09:08    阅读次数:213
LintCode "Find the Weak Connected Component in the Directed Graph"
New stuff learnt - Union-Find. Simpler and more elegant than I thought.class Solution { unordered_map father; int find(int val) { if(!...
分类:其他好文   时间:2015-10-21 14:08:51    阅读次数:191
Operating System: Three Easy Pieces --- Limited Directed Execution (Note)
In order to virtualize the CPU, the operating system needs to somehow share the physical CPUamong many jobs running seemingly at the same time. The ba...
分类:其他好文   时间:2015-10-16 13:27:48    阅读次数:262
判断是否是树(Is It A Tree?)
DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edg...
分类:其他好文   时间:2015-10-14 20:03:19    阅读次数:221
uva 11324 The Largest Clique(图论-tarjan,动态规划)
Problem B: The Largest CliqueGiven a directed graphG, consider the following transformation. First, create a new graphT(G)to have the same vertex set ...
分类:其他好文   时间:2015-09-25 11:05:24    阅读次数:180
LintCode "Route Between Two Nodes in Graph"
DFS ended up with TLE. Only BFS works./** * Definition for Directed graph. * struct DirectedGraphNode { * int label; * vector neighbors; * ...
分类:其他好文   时间:2015-09-24 07:04:31    阅读次数:188
315条   上一页 1 ... 21 22 23 24 25 ... 32 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!