Difference between revisions of "ShortestDistance Command"

From GeoGebra Manual
Jump to: navigation, search
m
m
Line 1: Line 1:
<noinclude>{{Manual Page|version=5.0}}</noinclude>
+
<noinclude>{{Manual Page|version=5.0}}</noinclude>{{command|discrete}}
{{command|discrete}}
 
 
;ShortestDistance[ <List of Segments>, <Start Point>, <End Point>, <Boolean Weighted> ]
 
;ShortestDistance[ <List of Segments>, <Start Point>, <End Point>, <Boolean Weighted> ]
 
: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).

Revision as of 08:45, 11 August 2015


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).
© 2020 International GeoGebra Institute