Select language: english | cesky | deutsch | italiano | simplified chinese | traditional chinese | hindi
Concept:
English word:
Home

tu2 jie2 dian3 (GraphNode)

Graphs are comprised of GraphNodes and GraphArcs. Every GraphNode is linked by a GraphArc.

Ontology

SUMO / GRAPH-THEORY

Superclass(es)

[tree]
shi2 ti3
is subclass of
  chou1 xiang4 de5  
is subclass of
  tu2 yuan2 jian4  
is subclass of
  tu2 jie2 dian3  

Coordinate term(s)

tu2 hu2 xian4 

Constrains relations

zui4 chu1 jie2 dian3 han2 shu4  zui4 hou4 jie2 dian3 han2 shu4  tu2 lu4 jing4 han2 shu4  qi3 shi3 jie2 dian3 han2 shu4  zui4 da4 liang4 lu4 jing4 han2 shu4  zui4 xiao3 liang4 lu4 jing4 han2 shu4  zhong1 jie2 dian3 han2 shu4  lian2 jie2 

Related WordNet synsets

See more related synsets on a separate page.

Axioms (3)

If graph shi4 tu2 de5 shi2 li4 and node1 shi4 tu2 jie2 dian3 de5 shi2 li4 and node2 shi4 tu2 jie2 dian3 de5 shi2 li4 and node1 shi4 graph de5 bu4 fen5 and node2 shi4 graph de5 bu4 fen5 and node1 deng3 yu1 node2, then there exist arc,path so_that_not 
(=>
      (and
            (instance ?GRAPH Graph)
            (instance ?NODE1 GraphNode)
            (instance ?NODE2 GraphNode)
            (graphPart ?NODE1 ?GRAPH)
            (graphPart ?NODE2 ?GRAPH)
            (not
                  (equal ?NODE1 ?NODE2)))
      (exists
            (?ARC ?PATH)
            (or
                  (links ?NODE1 ?NODE2 ?ARC)
                  (and
                        (subGraph ?PATH ?GRAPH)
                        (instance ?PATH GraphPath)
                        (or
                              (and
                                    (equal
                                          (BeginNodeFn ?PATH)
                                          ?NODE1)
                                    (equal
                                          (EndNodeFn ?PATH)
                                          ?NODE2))
                              (and
                                    (equal
                                          (BeginNodeFn ?PATH)
                                          ?NODE2)
                                    (equal
                                          (EndNodeFn ?PATH)
                                          ?NODE1)))))))
tu2 yuan2 jian4 wan2 quan2 fen1 ge1 cheng2 tu2 jie2 dian3,tu2 hu2 xian4. 
(partition GraphElement GraphNode GraphArc)
If node shi4 tu2 jie2 dian3 de5 shi2 li4, then there exist other,arc so_that_not arc (mei2) lian2 jie2not(s) node he2 other. 
(=>
      (instance ?NODE GraphNode)
      (exists
            (?OTHER ?ARC)
            (links ?NODE ?OTHER ?ARC)))