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

圖弧線 (GraphArc)

Graphs are comprised of GraphNodes and GraphArcs. Every GraphArc links two GraphNodes.

Ontology

SUMO / GRAPH-THEORY

Superclass(es)

[tree]
實體
is subclass of
  抽象的  
is subclass of
  圖元件  
is subclass of
  圖弧線  

Subclass(es)

圖迴圈 

Coordinate term(s)

圖節點 

Constrains relations

起始節點函數  終節點函數  弧線重量  連結 

Related WordNet synsets

See more related synsets on a separate page.

Axioms (5)

If graph 是 有向圖 的 實例 and arc 是 圖弧線 的 實例 and arc 是 graph 的 部分, then there exist node1,node2 so that "arc 的 �_始節點" 等於 node1 and "arc 的 最終�`點" 等於 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)))))))
(=>
      (and
            (instance ?GRAPH GraphPath)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (=>
            (equal
                  (TerminalNodeFn ?ARC)
                  ?NODE)
            (not
                  (exists
                        (?OTHER)
                        (and
                              (equal
                                    (TerminalNodeFn ?OTHER)
                                    ?NODE)
                              (not
                                    (equal ?OTHER ?ARC)))))))
圖元件 完全 分割成 圖節點,圖弧線. 
(partition GraphElement GraphNode GraphArc)
If arc 是 圖弧線 的 實例, then there exist node1,node2 so that arc (沒) 連結not(s) node1 和 node2. 
(=>
      (instance ?ARC GraphArc)
      (exists
            (?NODE1 ?NODE2)
            (links ?NODE1 ?NODE2 ?ARC)))