晋太元中,武陵人捕鱼为业。缘溪行,忘路之远近。忽逢桃花林,夹岸数百步,中无杂树,芳草鲜美,落英缤纷。渔人甚异之,复前行,欲穷其林。 林尽水源,便得一山,山有小口,仿佛若有光。便舍船,从口入。初极狭,才通人。复行数十步,豁然开朗。土地平旷,屋舍俨然,有良田、美池、桑竹之属。阡陌交通,鸡犬相闻。其中往来种作,男女衣着,悉如外人。黄发垂髫,并怡然自乐。 见渔人,乃大惊,问所从来。具答之。便要还家,设酒杀鸡作食。村中闻有此人,咸来问讯。自云先世避秦时乱,率妻子邑人来此绝境,不复出焉,遂与外人间隔。问今是何世,乃不知有汉,无论魏晋。此人一一为具言所闻,皆叹惋。余人各复延至其家,皆出酒食。停数日,辞去。此中人语云:“不足为外人道也。”(间隔 一作:隔绝) 既出,得其船,便扶向路,处处志之。及郡下,诣太守,说如此。太守即遣人随其往,寻向所志,遂迷,不复得路。 南阳刘子骥,高尚士也,闻之,欣然规往。未果,寻病终。后遂无问津者。
|
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 : |
/* Takes a graph laid out by twopi and adds rings.
* Assumes ARGV[] = "root" "=" <rootname>, as output by twopi -v.
* Usage:
* twopi -v foo.dot > out 2> log
* gvpr -f addrings.g -a"`grep root log`" out | neato -n2 ...
*/
BEG_G {
graph_t og;
edge_t e;
node_t ctr = node($, ARGV[0]);
double rs = 1.0; /* min. slack between the squares of two consecutive radii */
int cx, cy;
int x, y;
node_t n;
int i, n_r;
int d;
int rads[int];
char* ctr_s = ctr.pos;
sscanf (ctr_s, "%d,%d", &cx, &cy);
if (hasAttr($, "ranksep")) {
sscanf ($.ranksep, "%f", &rs);
if (rs == 0.0) rs = 1.0;
}
rs *= 72;
rs = 1.5*rs*rs;
}
N [$ != ctr] {
sscanf ($.pos, "%d,%d", &x, &y);
d = (x-cx)*(x-cx) + (y-cy)*(y-cy);
for (rads[i]) {
if ((rads[i]-rs <= d) && (d <= rads[i]+rs)) return;
}
n_r++;
rads[n_r] = d;
}
END_G {
og = copy (NULL, $);
og.outputorder = "nodesfirst";
setDflt (og, "N", "label", "\\N");
for (rads[i]) {
n = node(og, "ring_"+((string)i));
n.shape = "circle";
n.pos = ctr_s;
n.style = "";
n.label = "";
d = rads[i];
n.width = sprintf("%f", sqrt(d)/36.0);
}
for (n=fstnode($);n;n = nxtnode(n))
clone (og, n);
for (n=fstnode($);n;n = nxtnode(n))
for (e=fstedge(n);e;e = nxtedge(e,n))
clone (og, e);
write(og);
}