码迷,mamicode.com
首页 >  
搜索关键字:graph coloring    ( 3748个结果
LeetCode133——Clone Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each ...
分类:其他好文   时间:2015-02-28 13:07:11    阅读次数:119
SDUTOJ 2498 AOE网上的关键路径 最短路spfa
Description     一个无环的有向图称为无环图(Directed Acyclic Graph),简称DAG图。     AOE(Activity On Edge)网:顾名思义,用边表示活动的网,当然它也是DAG。与AOV不同,活动都表示在了边上,如下图所示:                                           如上所示,共有11项活动(11条...
分类:其他好文   时间:2015-02-28 06:46:02    阅读次数:240
infoq - neo4j graph db
My name is Charles Humble and I am here at QCon New York 2014 with Ian Robinson. Ian, can you introduce yourself to the InfoQ community?Hello, I am Ia...
分类:数据库   时间:2015-02-28 00:12:03    阅读次数:197
git学习(2)
1 创建分支 git branch dev                      git checkout dev   也可以一步完成 git checkout -b dev 2 查看当前分支 git branch 3 合并分支 git merge dev 3 删除一个分支 git branch -d dev 5 查看分支合并的情况git log --graph --pre...
分类:其他好文   时间:2015-02-27 17:01:59    阅读次数:148
Git show-branch显示提交信息
git中查看日志,我们用的比较多的就是 git log 以及带一些参数,如:以一行显示提交日志:$ git log --pretty=oneline显示最后的几次提交日志:$ git log -4已界面的形式显示提交日志:$ git log --graph等等。。。。。但是另外还有一个命令,大家可能...
分类:其他好文   时间:2015-02-27 16:35:32    阅读次数:149
PAT1021. Deepest Root
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the...
分类:其他好文   时间:2015-02-27 09:56:06    阅读次数:110
hdu 4635 强连通分量+缩点
http://acm.hdu.edu.cn/showproblem.php?pid=4635 Problem Description Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the gr...
分类:其他好文   时间:2015-02-26 18:35:11    阅读次数:148
133. Clone Graph Leetcode Python
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each...
分类:编程语言   时间:2015-02-26 11:41:10    阅读次数:181
递归与分治
棋盘覆盖2^k的棋盘格子,有一个缺陷,用L形状的的拼图把棋盘覆盖。每次涂抹的时候先按照缺陷的四周涂抹……23333参考int dir[4][2] = {{0,0},{0,1},{1,0},{1,1}}; ///棋盘L形状对应的分别缺少那个格子int graph[10000][10000];void....
分类:其他好文   时间:2015-02-24 22:12:17    阅读次数:174
PAT 05-1 List Components (简单DFS与BFS)
刚一拿到这道题把他想的太复杂了 明明是长度最大为十的顺序结构就能解决的问题,竟然优先想到用链表。 BFS牵扯到一个队列的操作,在这种小规模数据里面 用顺序结构好很多 题目如下: For a given undirected graph with N vertices and E edges, please list all the connected...
分类:其他好文   时间:2015-02-24 09:09:25    阅读次数:242
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!