minimal weighted path fn (MinimalWeightedPathFn)

This BinaryFunction assigns two GraphNodes to the GraphPath with the smallest sum of weighted arcs between the two GraphNodes.

Ontology

SUMO / GRAPH-THEORY

Class(es)

varga

inheritable relation

dvi-aadhaary prakaarya

minimal weighted path fn

Coordinate term(s)

addition fn day fn density fn division fn edition fn exponentiation fn graph path fn hour fn intersection fn interval fn kappa fn list concatenate fn list order fn log fn max fn maximal weighted path fn measure fn mereological difference fn mereological product fn mereological sum fn min fn minute fn month fn multiplication fn periodical issue fn recurrent time interval fn relative complement fn relative time fn remainder fn second fn series volume fn speed fn subtraction fn temporal composition fn time interval fn union fn where fn

Type restrictions

aalekha patha MinimalWeightedPathFn(granthi aalekha, granthi aalekha)

Axioms (4)

Agar "the lowest cost path between node1 and node2" is equal to path, to path is an instance of "the set of paths between node1 and node2".

(=>
      (equal
            (MinimalWeightedPathFn ?NODE1 ?NODE2)
            ?PATH)
      (instance
            ?PATH
            (GraphPathFn ?NODE1 ?NODE2)))

agar "the lowest cost path between node1 and node2" is equal to path aur "the value of path" is equal to number,
to sab-kuch path2 ke lie hai, ki: agar path2 is an instance of "the set of paths between node1 and node2" aur "the value of path2" is equal to number2, to number2 is greater than or equal to number1

(=>
      (and
            (equal
                  (MinimalWeightedPathFn ?NODE1 ?NODE2)
                  ?PATH)
            (equal
                  (PathWeightFn ?PATH)
                  ?NUMBER))
      (forall
            (?PATH2)
            (=>
                  (and
                        (instance
                              ?PATH2
                              (GraphPathFn ?NODE1 ?NODE2))
                        (equal
                              (PathWeightFn ?PATH2)
                              ?NUMBER2))
                  (greaterThanOrEqualTo ?NUMBER2 ?NUMBER1))))

(,minimal weighted path fn,) ke lie hai, ki.

(forma cn MinimalWeightedPathFn "%1 ©M %2 ¶¡ &%³Ì¤p¸ô®|")

(,minimal weighted path fn,) ke lie hai, ki.

(forma cn MinimalWeightedPathFn "%1 he2 %2 jian4 &%zui4 xiao3 lu4 jing4")