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

pratyaksha aalekha (DirectedGraph)

The Class of directed graphs. A directed graph is a Graph in which all GraphArcs have direction, i.e. every GraphArc has an initial node (see InitialNodeFn) and a terminal node (see TerminalNodeFn).

Ontology

SUMO / GRAPH-THEORY

Superclass(es)

[tree]
astitva
is subclass of
  amUrta  
is subclass of
  aalekha  
is subclass of
  pratyaksha aalekha  

Subclass(es)

aalekha patha 

Coordinate term(s)

bahu aalekha  aabhaasii aalekha  vriksha 

Axioms (2)

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 path is a part of graph aur graph is not an instance of pratyaksha aalekha, to "the set of paths between node1 and node2" is equal to path agar hai "the set of paths between node2 and node1" is equal to path. 
(=>
      (and
            (graphPart ?PATH ?GRAPH)
            (not
                  (instance ?GRAPH DirectedGraph)))
      (<=>
            (equal
                  (GraphPathFn ?NODE1 ?NODE2)
                  ?PATH)
            (equal
                  (GraphPathFn ?NODE2 ?NODE1)
                  ?PATH)))