qi3 shi3 jie2 dian3 han2 shu4 (InitialNodeFn)
A UnaryFunction that maps a
GraphArc to the initial node of the GraphArc. Note
that this is a partial function. In particular, the function is
undefined for GraphArcs that are not part of a DirectedGraph.
Ontology
SUMO / GRAPH-THEORYClass(es)
Coordinate term(s)
jue2 dui4 zhi2 han2 shu4
miao2 shu4 han2 shu4
hu2 yu2 xian2
hu2 zheng4 xian2
hu2 zheng4 qie1
fan3 mian4 han2 shu4
shi2 jian1 kai1 shi3 han2 shu4
zui4 chu1 jie2 dian3 han2 shu4
ji4 shu4 han2 shu4
shang4 xian4 han2 shu4
hu4 bu3 han2 shu4
yu2 xian2 han2 shu4
xiang1 jiao1 lu4 jing4 han2 shu4
dan1 wei4 han2 shu4
shi2 jian1 jie2 shu4 han2 shi4
zui4 hou4 jie2 dian3 han2 shu4
fan4 wei2 han2 shu4
xia4 xian4 han2 shu4
zheng4 mian4 han2 shu4
shi2 jian1 wei4 lai2 han2 shi4
gai4 hua4 han2 shu4
gai4 hua4 lian2 ji2 han2 shu4
shi2 yi4 ji4 han2 shu4
xu1 shu4 han2 shu4
zui4 jin4 wei4 lai2 shi2 jian1 han2 shu4
zui4 jin4 guo4 qu4 shi2 jian1 han2 shu4
zheng3 shu4 ping2 fang1 gen1 han2 shu4
qian1 ji4 han2 shu4
lie4 zhang3 han2 shu4
ji2 shu4 han2 shu4
bai3 wan4 ji4 han2 shu4
bai3 wan4 fen1 zhi1 yi1 ji4 han2 shu4
qian1 fen1 zhi1 yi1 ji4 han2 shu4
zui4 xiao3 xiang1 jiao1 lu4 jing4 han2 shu4
nai4 mi3 han2 shu4
fen1 zi3 han2 shu4
zu3 zhi1 han2 shu4
guo4 qu4 shi2 jian1 han2 shi4
lu4 jing4 liang4 han2 shu4
zhao4 fen1 zhi1 yi1 ji4 han2 shu4
mi4 ji2 he2 han2 shu4
qian2 shu4 han2 shu4
zhu3 ti1 han2 shu4
huo4 ran2 lv4 han2 shu4
te4 xing4 han2 shu4
you3 li3 shu4 han2 shu4
shi2 shu4 han2 shu4
dao3 shu4 han2 shu4
zheng3 shu4 han2 shu4
zheng4 fu4 hao4 han2 shu4
zheng4 xian2 han2 shu4
biao3 pi2 han2 shu4
ping2 fang1 gen1 han2 shu4
hou4 shu4 han2 shu4
zheng4 qie1 han2 shu4
zhao4 ji4 han2 shu4
zhong1 jie2 dian3 han2 shu4
cai2 chan3 han2 shu4
cun2 zai4 shi2 jian1 han2 shu4
nian2 fen4 han2 shu4
Type restrictions
tu2 jie2 dian3 InitialNodeFn(tu2 hu2 xian4)
Axioms (4)
If graph shi4 you3 xiang4 tu2 de5 shi2 li4 and arc shi4 tu2 hu2 xian4 de5 shi2 li4 and arc shi4 graph de5 bu4 fen5, then there exist node1,node2 so_that_not "arc de5 qi3 shi3 jie2 dian3" deng3 yu1 node1 and "arc de5 zui4 zhong1 jie2 dian3" deng3 yu1 node2.
(=>
(and
(instance ?GRAPH DirectedGraph)
(instance ?ARC GraphArc)
(graphPart ?ARC ?GRAPH))
(exists
(?NODE1 ?NODE2)
(and
(equal
(InitialNodeFn ?ARC)
?NODE1)
(equal
(TerminalNodeFn ?ARC)
?NODE2))))
(=>
(and
(instance ?GRAPH GraphPath)
(instance ?ARC GraphArc)
(graphPart ?ARC ?GRAPH))
(=>
(equal
(InitialNodeFn ?ARC)
?NODE)
(not
(exists
(?OTHER)
(and
(equal
(InitialNodeFn ?OTHER)
?NODE)
(not
(equal ?OTHER ?ARC)))))))
If "arc de5 qi3 shi3 jie2 dian3" deng3 yu1 node and "arc de5 zui4 zhong1 jie2 dian3" deng3 yu1 node, then arc shi4 tu2 hui2 quan1 de5 shi2 li4.
(=>
(and
(equal
(InitialNodeFn ?ARC)
?NODE)
(equal
(TerminalNodeFn ?ARC)
?NODE))
(instance ?ARC GraphLoop))
zui4 chu1 jie2 dian3 han2 shu4 na4 bu4 xiang1 guan1 yu1 qi3 shi3 jie2 dian3 han2 shu4.
(relatedInternalConcept BeginNodeFn InitialNodeFn)