aalekha patha (GraphPath)
Informally, a single, directed route between
two GraphNodes in a Graph. Formally, a DirectedGraph that is a
subGraph of the original Graph and such that no two GraphArcs in
the DirectedGraph have the same intial node (see InitialNodeFn) or
the same terminal node (see TerminalNodeFn).
Ontology
SUMO / GRAPH-THEORYSuperclass(es)
Subclass(es)
aalekha paripatha
Constrains relations
begin node fn
cut set fn
end node fn
graph path fn
maximal weighted path fn
minimal cut set fn
minimal weighted path fn
path weight fn
path length
Related WordNet synsets
See more related synsets on a separate page.
Axioms (3)
Agar graph is an instance of aalekha aur node1 is an instance of granthi aalekha aur node2 is an instance of granthi aalekha aur node1 is a part of graph aur node2 is a part of graph aur node1 is not equal to node2, to yah kuch arc,path nahin, ki - arc links node1 and node2
yaa .
(=>
(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)))))))
(=>
(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)))))))