@prefix p: <http://www.wikidata.org/prop/> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix schema1: <http://schema.org/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix wd: <http://www.wikidata.org/entity/> .
@prefix wds: <http://www.wikidata.org/entity/statement/> .
@prefix wdt: <http://www.wikidata.org/prop/direct/> .
@prefix wdtn: <http://www.wikidata.org/prop/direct-normalized/> .
@prefix wikibase: <http://wikiba.se/ontology#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

wd:Q1361537 rdfs:label "connectivitat-st"@ca,
        "st-Erreichbarkeit"@de,
        "st-connectivity"@en,
        "st-connectivity"@en-gb,
        "st-elérhetőség"@hu,
        "st-connectivity"@it,
        "Conectividade st"@pt,
        "st-povezljivost"@sl,
        "st連通性"@zh,
        "st連通性"@zh-hant,
        "st連通性"@zh-tw ;
    schema1:dateModified "2025-02-02T15:21:19+00:00"^^xsd:dateTime ;
    schema1:description "problema de decisió dins de grafs dirigits"@ca,
        "algorithmisches Problem in der Graphentheorie"@de,
        "decision problem in graph theory"@en,
        "圖上兩點之間是否存在一個路徑"@zh-tw ;
    schema1:version 2305849706 ;
    wikibase:identifiers 2 ;
    wikibase:sitelinks 5 ;
    wikibase:statements 5 ;
    skos:altLabel "STCON"@ca,
        "STCON"@de,
        "USTCON"@de,
        "GAP"@en,
        "STCON"@en,
        "graph accessibility problem"@en,
        "st-összefüggőség"@hu,
        "STCON"@it ;
    p:P10374 wds:Q1361537-6587279d-4503-51c8-af8e-ef56e8258327 ;
    p:P2283 wds:Q1361537-56c86661-48c2-7f7c-949d-83efeef38c61 ;
    p:P31 wds:Q1361537-390ece85-4c6f-7aa6-9d49-315172d23053 ;
    p:P6366 wds:Q1361537-D1E3DDF8-95B7-4875-93B2-BA78E25E14DB ;
    p:P646 wds:Q1361537-5CC244F4-A4C1-46EF-96BC-488487C84196 ;
    wdtn:P6366 <https://makg.org/entity/134013329> ;
    wdt:P10374 wd:Q12857599 ;
    wdt:P2283 wd:Q1361526 ;
    wdt:P31 wd:Q3262192 ;
    wdt:P6366 "134013329" ;
    wdt:P646 "/m/085m2j" .