Difference between revisions of "ShortestDistance Command"
From GeoGebra Manual
m (Text replace - "<div class="box info"> 48px|left This page is part of the official manual for print and pdf. For structural reasons normal users can't edit this page. If you found any errors on this page please contact ) |
(command syntax: changed [ ] into ( )) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | <noinclude>{{Manual Page|version= | + | <noinclude>{{Manual Page|version=5.0}}</noinclude>{{command|discrete}} |
| − | {{command|discrete}} | + | ;ShortestDistance( <List of Segments>, <Start Point>, <End Point>, <Boolean Weighted> ) |
| − | ;ShortestDistance | ||
:Finds shortest path between start point and endpoint in a [[w:Graph (mathematics)|graph]] given by list of segments. If weighted is false, [[w:Weighted_graph#Weighted_graphs_and_networks|weight]] of each edge is supposed to be 1 (i.e. we are looking for the path with least number of edges), otherwise it is the length of given segment (we are looking for the geometrically shortest path). | :Finds shortest path between start point and endpoint in a [[w:Graph (mathematics)|graph]] given by list of segments. If weighted is false, [[w:Weighted_graph#Weighted_graphs_and_networks|weight]] of each edge is supposed to be 1 (i.e. we are looking for the path with least number of edges), otherwise it is the length of given segment (we are looking for the geometrically shortest path). | ||
Latest revision as of 18:49, 30 September 2017
- ShortestDistance( <List of Segments>, <Start Point>, <End Point>, <Boolean Weighted> )
- Finds shortest path between start point and endpoint in a graph given by list of segments. If weighted is false, weight of each edge is supposed to be 1 (i.e. we are looking for the path with least number of edges), otherwise it is the length of given segment (we are looking for the geometrically shortest path).
