Undirected

LeetCode:Clone Graph

题目如下：实现克隆图的算法  题目链接 Clone an undirected graph.
·2013-11-11 19:00

Local Search

 The Maximum Cut Problem     --  Input : An undirected graph G = (V , E).
leonzhx·2013-10-23 23:00

leetcode -- Clone Graph

Clone an undirected graph.
·2013-10-04 21:00

Kruskal's MST Algorithm

 MST Review :     a) Input : Undirected graph G = (V; E), edge costs ce.
leonzhx·2013-09-30 22:00

SPOJ 375. Query on a tree （动态树）

Query on a tree Problem code: QTREE   You are given a tree (an acyclic undirected connected
·2013-09-04 00:00

POJ 1679 The Unique MST （Kruskal判断最小生成树是否唯一）

Total Submissions: 17062   Accepted: 5920 Description Given a connected undirected
hefeijack·2013-07-08 09:00

POJ 1679 The Unique MST

Description Given a connected undirected graph, tell if its minimum spanning tree is unique.
java-mans·2012-08-01 23:00
上一页 1 2 3 4 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他