. "Em teoria dos grafos, a atingibilidade se refere a capacidade de ir de um v\u00E9rtice para outro em um grafo. Dizemos que um v\u00E9rtice pode alcan\u00E7ar outro v\u00E9rtice (ou que \u00E9 ating\u00EDvel a partir de ) se exite uma sequ\u00EAncia de v\u00E9rtices adjacentes (ex.: um caminho) que come\u00E7am com e terminam com ."@pt . . . . . . "Osi\u0105galno\u015B\u0107 (teoria graf\u00F3w) \u2013 relacja dwuargumentowa okre\u015Blona na zbiorze wierzcho\u0142k\u00F3w danego grafu skierowanego G = (V, E), gdzie V jest sko\u0144czonym zbiorem wierzcho\u0142k\u00F3w i E jest sko\u0144czonym zbiorem kraw\u0119dzi (kt\u00F3re s\u0105 parami wierzcho\u0142k\u00F3w) tego grafu. Relacja osi\u0105galno\u015Bci zachodzi dla pary (x,y) (x,y \u220A V) wtedy i tylko wtedy, gdy istnieje \u015Bcie\u017Cka w grafie G prowadz\u0105ca od wierzcho\u0142ka x do wierzcho\u0142ka y. W\u00F3wczas m\u00F3wimy, \u017Ce wierzcho\u0142ek y jest osi\u0105galny z wierzcho\u0142ka x w grafie G."@pl . . . . . "Reachability"@en . "\uB3C4\uB2EC\uC131"@ko . . . . . . "\u0414\u043E\u0441\u0442\u0438\u0436\u0438\u043C\u043E\u0441\u0442\u044C"@ru . "1111929893"^^ . . . . "Em teoria dos grafos, a atingibilidade se refere a capacidade de ir de um v\u00E9rtice para outro em um grafo. Dizemos que um v\u00E9rtice pode alcan\u00E7ar outro v\u00E9rtice (ou que \u00E9 ating\u00EDvel a partir de ) se exite uma sequ\u00EAncia de v\u00E9rtices adjacentes (ex.: um caminho) que come\u00E7am com e terminam com . Em um grafo n\u00E3o-direcionado, \u00E9 suficiente identificar apenas os componentes conexos, assim como qualquer par de v\u00E9rtices, em tal grafo, pode se alcan\u00E7ar se e somente se eles pertencem ao mesmo componente conexo. Os componentes conexos de um grafo podem ser identificados em tempo linear. Lembramos que este artigo foca em atingibilidade nas configura\u00E7\u00F5es de grafos orientados."@pt . "In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable from ) if there exists a sequence of adjacent vertices (i.e. a walk) which starts with and ends with ."@en . . . . "2833097"^^ . . . . . . "Osi\u0105galno\u015B\u0107 (teoria graf\u00F3w)"@pl . . . . . . . . "16108"^^ . "Atingibilidade (teoria dos grafos)"@pt . . . "Osi\u0105galno\u015B\u0107 (teoria graf\u00F3w) \u2013 relacja dwuargumentowa okre\u015Blona na zbiorze wierzcho\u0142k\u00F3w danego grafu skierowanego G = (V, E), gdzie V jest sko\u0144czonym zbiorem wierzcho\u0142k\u00F3w i E jest sko\u0144czonym zbiorem kraw\u0119dzi (kt\u00F3re s\u0105 parami wierzcho\u0142k\u00F3w) tego grafu. Relacja osi\u0105galno\u015Bci zachodzi dla pary (x,y) (x,y \u220A V) wtedy i tylko wtedy, gdy istnieje \u015Bcie\u017Cka w grafie G prowadz\u0105ca od wierzcho\u0142ka x do wierzcho\u0142ka y. W\u00F3wczas m\u00F3wimy, \u017Ce wierzcho\u0142ek y jest osi\u0105galny z wierzcho\u0142ka x w grafie G."@pl . . . . "In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable from ) if there exists a sequence of adjacent vertices (i.e. a walk) which starts with and ends with . In an undirected graph, reachability between all pairs of vertices can be determined by identifying the connected components of the graph. Any pair of vertices in such a graph can reach each other if and only if they belong to the same connected component; therefore, in such a graph, reachability is symmetric ( reaches iff reaches ). The connected components of an undirected graph can be identified in linear time. The remainder of this article focuses on the more difficult problem of determining pairwise reachability in a directed graph (which, incidentally, need not be symmetric)."@en . . . . . . . . "\uADF8\uB798\uD504 \uC774\uB860\uC5D0\uC11C \uB3C4\uB2EC\uC131, \uB3C4\uB2EC \uAC00\uB2A5\uC131(reachability)\uC740 \uADF8\uB798\uD504 \uC548\uC758 \uD558\uB098\uC758 \uAF2D\uC9D3\uC810\uC5D0\uC11C \uB2E4\uB978 \uAF2D\uC9D3\uC810\uC73C\uB85C \uB3C4\uB2EC\uD560 \uC218 \uC788\uB294 \uAC00\uB2A5\uC131\uC744 \uB9D0\uD55C\uB2E4. \uB85C \uC2DC\uC791\uD558\uACE0 \uB85C \uB05D\uB098\uB294 \uC778\uC811\uD55C \uC77C\uB828\uC758 \uAF2D\uC9D3\uC810(\uC608: \uACBD\uB85C)\uC774 \uC788\uB2E4\uBA74 \uAF2D\uC9D3\uC810 \uB294 \uAF2D\uC9D3\uC810 \uC5D0 \uB3C4\uB2EC\uD560 \uC218 \uC788\uB2E4.(\uADF8\uB9AC\uACE0 \uB294 \uB85C\uBD80\uD130 \uB3C4\uB2EC\uC774 \uAC00\uB2A5\uD558\uB2E4) \uBC29\uD5A5\uC774 \uC5C6\uB294(\uBB34\uD5A5) \uADF8\uB798\uD504\uC5D0\uC11C \uD55C \uC30D\uC758 \uAF2D\uC9D3\uC810 \uAC04\uC758 \uB3C4\uB2EC\uC131\uC740 \uADF8\uB798\uD504\uC758 \uC5F0\uACB0 \uC694\uC18C\uB97C \uC2DD\uBCC4\uD568\uC73C\uB85C\uC368 \uACB0\uC815\uD560 \uC218 \uC788\uB2E4. \uC774\uB7EC\uD55C \uADF8\uB798\uD504\uC5D0\uC11C \uC784\uC758\uC758 \uC30D\uC758 \uAF2D\uC9D3\uC810\uB4E4\uC740 \uB3D9\uC77C\uD55C \uC5F0\uACB0 \uC694\uC18C\uC5D0 \uC18D\uD574 \uC788\uC744 \uACBD\uC6B0 \uC11C\uB85C\uC5D0\uAC8C \uB3C4\uB2EC\uD560 \uC218 \uC788\uB2E4. \uBB34\uD5A5 \uADF8\uB798\uD504\uC758 \uC5F0\uACB0 \uC694\uC18C\uB294 \uC120\uD615 \uC2DC\uAC04\uC5D0\uC11C \uC2DD\uBCC4\uC774 \uAC00\uB2A5\uD558\uB2E4."@ko . "\uADF8\uB798\uD504 \uC774\uB860\uC5D0\uC11C \uB3C4\uB2EC\uC131, \uB3C4\uB2EC \uAC00\uB2A5\uC131(reachability)\uC740 \uADF8\uB798\uD504 \uC548\uC758 \uD558\uB098\uC758 \uAF2D\uC9D3\uC810\uC5D0\uC11C \uB2E4\uB978 \uAF2D\uC9D3\uC810\uC73C\uB85C \uB3C4\uB2EC\uD560 \uC218 \uC788\uB294 \uAC00\uB2A5\uC131\uC744 \uB9D0\uD55C\uB2E4. \uB85C \uC2DC\uC791\uD558\uACE0 \uB85C \uB05D\uB098\uB294 \uC778\uC811\uD55C \uC77C\uB828\uC758 \uAF2D\uC9D3\uC810(\uC608: \uACBD\uB85C)\uC774 \uC788\uB2E4\uBA74 \uAF2D\uC9D3\uC810 \uB294 \uAF2D\uC9D3\uC810 \uC5D0 \uB3C4\uB2EC\uD560 \uC218 \uC788\uB2E4.(\uADF8\uB9AC\uACE0 \uB294 \uB85C\uBD80\uD130 \uB3C4\uB2EC\uC774 \uAC00\uB2A5\uD558\uB2E4) \uBC29\uD5A5\uC774 \uC5C6\uB294(\uBB34\uD5A5) \uADF8\uB798\uD504\uC5D0\uC11C \uD55C \uC30D\uC758 \uAF2D\uC9D3\uC810 \uAC04\uC758 \uB3C4\uB2EC\uC131\uC740 \uADF8\uB798\uD504\uC758 \uC5F0\uACB0 \uC694\uC18C\uB97C \uC2DD\uBCC4\uD568\uC73C\uB85C\uC368 \uACB0\uC815\uD560 \uC218 \uC788\uB2E4. \uC774\uB7EC\uD55C \uADF8\uB798\uD504\uC5D0\uC11C \uC784\uC758\uC758 \uC30D\uC758 \uAF2D\uC9D3\uC810\uB4E4\uC740 \uB3D9\uC77C\uD55C \uC5F0\uACB0 \uC694\uC18C\uC5D0 \uC18D\uD574 \uC788\uC744 \uACBD\uC6B0 \uC11C\uB85C\uC5D0\uAC8C \uB3C4\uB2EC\uD560 \uC218 \uC788\uB2E4. \uBB34\uD5A5 \uADF8\uB798\uD504\uC758 \uC5F0\uACB0 \uC694\uC18C\uB294 \uC120\uD615 \uC2DC\uAC04\uC5D0\uC11C \uC2DD\uBCC4\uC774 \uAC00\uB2A5\uD558\uB2E4."@ko .