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

圖節點 (GraphNode)

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

Ontology

SUMO / GRAPH-THEORY

Superclass(es)

[tree]
實體
is subclass of
  抽象的  
is subclass of
  圖元件  
is subclass of
  圖節點  

Coordinate term(s)

圖弧線 

Constrains relations

最初節點函數  最後節點函數  圖路徑函數  起始節點函數  最大量路徑函數  最小量路徑函數  終節點函數  連結 

Related WordNet synsets

See more related synsets on a separate page.

Axioms (3)

If graph 是 圖 的 實例 and node1 是 圖節點 的 實例 and node2 是 圖節點 的 實例 and node1 是 graph 的 部分 and node2 是 graph 的 部分 and node1 等於 node2, then there exist arc,path so that 
(=>
      (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)))))))
圖元件 完全 分割成 圖節點,圖弧線. 
(partition GraphElement GraphNode GraphArc)
If node 是 圖節點 的 實例, then there exist other,arc so that arc (沒) 連結not(s) node 和 other. 
(=>
      (instance ?NODE GraphNode)
      (exists
            (?OTHER ?ARC)
            (links ?NODE ?OTHER ?ARC)))