@prefix n9j: <http://data.loterre.fr/ark:/67375/N9J> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix isothes: <http://purl.org/iso25964/skos-thes#> .

n9j:-RCJFJ90N-M
  owl:sameAs <https://concepts.sagepub.com/social-science/concept/shortest-path_problem> ;
  skos:definition "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]"@en ;
  a skos:Concept ;
  skos:inScheme n9j: ;
  skos:broader n9j:-GJQK2BHG-K ;
  skos:prefLabel "shortest-path problem"@en .

n9j:-GJQK2BHG-K
  skos:prefLabel "quantitative geography"@en ;
  a skos:Concept ;
  skos:narrower n9j:-RCJFJ90N-M .

n9j:-concepts
  a isothes:ConceptGroup ;
  skos:prefLabel "concepts"@en ;
  skos:member n9j:-RCJFJ90N-M .

n9j: a skos:ConceptScheme .