terminal node fn (TerminalNodeFn)

A UnaryFunction that maps a GraphArc to the terminal 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-THEORY

Class(es)

varga

inheritable relation

ekaadhaary prakaarya

terminal node fn

Coordinate term(s)

absolute value fn abstraction fn arc cosine fn arc sine fn arc tangent fn back fn begin fn begin node fn cardinality fn ceiling fn complement fn cosine fn cut set fn denominator fn end fn end node fn extension fn floor fn front fn future fn generalized intersection fn generalized union fn giga fn imaginary part fn immediate future fn immediate past fn initial node fn integer square root fn kilo fn list length fn magnitude fn mega fn micro fn milli fn minimal cut set fn nano fn numerator fn organization fn past fn path weight fn pico fn power set fn predecessor fn principal host fn probability fn property fn rational number fn real number fn reciprocal fn round fn signum fn sine fn skin fn square root fn successor fn tangent fn tera fn wealth fn when fn year fn

Type restrictions

granthi aalekha TerminalNodeFn(chaapa aalekha)

Axioms (4)

Agar graph is an instance of pratyaksha aalekha aur arc is an instance of chaapa aalekha aur arc is a part of graph, to yah kuch node1,node2 nahin, ki "the starting node of arc" is equal to node1 aur "the terminal node of arc" is equal to node2.

(=>
      (and
            (instance ?GRAPH DirectedGraph)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (exists
            (?NODE1 ?NODE2)
            (and
                  (equal
                        (InitialNodeFn ?ARC)
                        ?NODE1)
                  (equal
                        (TerminalNodeFn ?ARC)
                        ?NODE2))))

agar graph is an instance of aalekha patha aur arc is an instance of chaapa aalekha aur arc is a part of graph,
to agar "the terminal node of arc" is equal to node, to yah kuch other nahin, ki "the terminal node of other" is equal to node aur other is not equal to 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)))))))

Agar "the starting node of arc" is equal to node aur "the terminal node of arc" is equal to node, to arc is an instance of aalekha paasha.

(=>
      (and
            (equal
                  (InitialNodeFn ?ARC)
                  ?NODE)
            (equal
                  (TerminalNodeFn ?ARC)
                  ?NODE))
      (instance ?ARC GraphLoop))

end node fn is internally related to terminal node fn.

(relatedInternalConcept EndNodeFn TerminalNodeFn)