码迷,mamicode.com
首页 >  
搜索关键字:directed    ( 315个结果
SDUT 2498-AOE网上的关键路径(spfa+字典序路径)
AOE网上的关键路径Time Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描写叙述 一个无环的有向图称为无环图(Directed Acyclic Graph),简称DAG图。 AOE(Activity On Edge)网:顾名思义,用边表示活动的网,当...
分类:其他好文   时间:2015-05-01 19:56:11    阅读次数:200
Codeforces Round #179 (Div. 2)---D. Greg and Graph(离线+floyd)
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has in...
分类:其他好文   时间:2015-04-27 15:17:42    阅读次数:112
Lintcode: Topological Sorting
Given an directed graph, a topological order of the graph nodes is defined as follow:For each directed edge A-->B in graph, A must before B in the ord...
分类:其他好文   时间:2015-04-16 13:48:58    阅读次数:253
有向无环图的应用—AOV网 和 拓扑排序
有向无环图:无环的有向图,简称 DAG (Directed Acycline Graph) 图。一个有向图的生成树是一个有向树,一个非连通有向图的若干强连通分量生成若干有向树,这些有向数形成生成森林。在工程计划和管理方面的应用除最简单的情况之外,几乎所有的工程都可分为若干个称作“活动”的子工程,并且...
分类:编程语言   时间:2015-04-14 00:35:20    阅读次数:149
hihoCoder #1087 Hamiltonian Cycle
DescriptionGiven a directed graph containing n vertice (numbered from 1 to n) and m edges. Can you tell us how many different Hamiltonian Cycles are t...
分类:其他好文   时间:2015-04-06 21:34:45    阅读次数:144
拓扑排序
拓扑排序         对一个有向无环图(Directed Acyclic Graph简称DAG)G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任意一对顶点u和v,若边(u,v)∈E(G),则u在线性序列中出现在v之前。         一个有向图无法拓扑排序时只有一种情况:该有向图中存在环。下面给出简单的判定有向图是否可拓扑排序的代码: 题意:给你一个N点和M条有向边的图,问...
分类:编程语言   时间:2015-04-01 17:38:34    阅读次数:182
hdu5195 线段树
http://acm.hdu.edu.cn/showproblem.php?pid=5195 Problem Description A topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every d...
分类:其他好文   时间:2015-03-31 12:58:17    阅读次数:142
【SICP练习】147 练习4.3
练习4-3原文Exercise 4.3. Rewrite eval so that the dispatch is done in data-directed style. Compare this with the datadirected differentiation procedure of exercise 2.73. (You may use the car of a compound...
分类:其他好文   时间:2015-03-30 09:33:38    阅读次数:167
图 -- 基础
图 图可以分为有向图(directed graph)和无向图(undirected graph)。 每个顶点都临界的无向图为完全图(complete graph)。如果无向图G的顶点集V可以划分为V1,V2,是的对(u,v)属于E有u属于V1,v属于V2,则称图为二分图(bipartite gr.....
分类:其他好文   时间:2015-03-13 16:00:19    阅读次数:183
拓扑排序
一、概述 对一个有向无环图(Directed Acyclic Graph简称DAG)G进行拓扑排序,是将G中全部顶点排成一个线性序列,使得图中随意一对顶点u和v,若 ∈E(G),则u在线性序列中出如今v之前。 通常,这种线性序列称为满足拓扑次序(TopoiSicai Order)的序列,简称拓扑.....
分类:编程语言   时间:2015-03-11 19:34:04    阅读次数:185
315条   上一页 1 ... 24 25 26 27 28 ... 32 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!