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

# maximal weighted path fn (MaximalWeightedPathFn)

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

## Ontology

SUMO / GRAPH-THEORY

## Class(es)

 varga

inheritable relation

maximal 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  measure fn  mereological difference fn  mereological product fn  mereological sum fn  min fn  minimal weighted path 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 MaximalWeightedPathFn(granthi aalekha, granthi aalekha)

## Axioms (2)

Agar "the highest 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
(MaximalWeightedPathFn ?NODE1 ?NODE2)
?PATH)
(instance
?PATH
(GraphPathFn ?NODE1 ?NODE2)))```

• agar "the highest 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 less than or equal to number1
• .
```(=>
(and
(equal
(MaximalWeightedPathFn ?NODE1 ?NODE2)
?PATH)
(equal
(PathWeightFn ?PATH)
?NUMBER))
(forall
(?PATH2)
(=>
(and
(instance
?PATH2
(GraphPathFn ?NODE1 ?NODE2))
(equal
(PathWeightFn ?PATH2)
?NUMBER2))
(lessThanOrEqualTo ?NUMBER2 ?NUMBER1))))```