d3 tree graph

Topic Link: Click to open the linkFor a tree without a direction:Start at any point, find the farthest point, set this as the starting point, and find the farthest point from the starting point as the destination.This road is the diameter.two times BFS;#include Sdut 3045-Graph theory of Mystery (diameter of tree)

Graph write tree Uva-10562 Approximate question: Converts a multi-Cross Tree into a bracket expression. Each node contains only "-", "|", and spaces. Each non-leaf node always has a "|" character at the front and bottom, followed by a row of "-" characters, which exactly overwrites the top of all child nodes. A single line "#" indicates the end mark of the data.

The topic describes that there are N cities, some of which can be built between highways, and the cost of building different highways is different.Now we want to know, at least how much it costs to repair the road can connect all the cities together, so that in any city, you can reach any other city. The input input contains multiple sets of data in the following format. The first line consists of two integers n m, representing the number of cities and the number of roads that can be built.(n 3

DFS to check cyclic. Please note some details.classsolution{unordered_mapint, unordered_setint>>G; Unordered_setint>visited; BOOLGointIintP//True-cyclic{Visited.insert (i); Autocs =G[i]; for(Auto C:cs) {if(c = = p)Continue; if(Visited.find (c)! = Visited.end ())return true; BOOLb =Go (c, i); if(b)return true; } return false; } Public: BOOLValidtree (intN, vectorint,int>>edges) { intVCNT = N-1; intECNT =edges.size (); if(ecnt! = vcnt)return false; //Build Graphs for(Auto

#include#include#include#include#includeusing namespacestd;#defineN 100107Vectorint>G[n],query[n];intFa[n],l[n],r[n],vis[n],time,doc[n],f[n];structnode{intOp,x,y;} Q[n];intFindset (intx) {if(x = fa[x]) fa[x] =Findset (fa[x]); returnfa[x];}voidDfsintu) {Vis[u]=1; L[u]= ++Time ; for(intI=0; I) { intv =G[u][i]; DFS (v); } R[u]= ++Time ;}intMain () {intN,m,i,op,doc =0, DocNum; memset (Vis,0,sizeof(VIS)); scanf ("%d%d",n,m); for(i=0; ii; for(i=1; i) {scanf ("%d",Q[i].op); if(Q[i].op = =1

/* DJ. W 2012.12.06 code function: converts an adjacent table graph into a Binary Tree represented by the child brother Method */# include

In addition to the template template there is a new idea in it: enumeration. #include The minimum spanning tree of UVa1395 graph theory

Title: http://acm.hdu.edu.cn/showproblem.php?pid=3072 Question: There are n individuals, there are M-Bar relationship U v C, which represents you can inform V to spend C, if they can connect with each other (can be indirectly through others), then spend 0, ask from the point of notice to everyone, minimum cost is how much. Train of thought: people who can relate to each other cost 0, means that in the same strong connected component of the point cost of 0, then naturally think of the reduction