Concept information
Terme préférentiel
shortest-path problem
Définition(s)
- The shortest-path problem is one of the most basic and widely applied forms of network analysis used in computational geometry and geographic information systems (GIS). Networks, or graphs, are used to model linear features such as roads and streets using a series of connected nodes (vertices or points) and links (edges or lines). [Source: Encyclopedia of Geography; Shortest-Path Problem]
Concept(s) générique(s)
Appartient au groupe
URI
http://data.loterre.fr/ark:/67375/N9J-RCJFJ90N-M
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}