Skip to content

Traduccion library distutils #1558

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
traducción
  • Loading branch information
lis17 committed Oct 16, 2021
commit 98a7ebaa5ec867eff8399b44133d68cc073acee1
25 changes: 19 additions & 6 deletions library/graphlib.po
Original file line number Diff line number Diff line change
Expand Up @@ -4,31 +4,35 @@
# package.
# FIRST AUTHOR <EMAIL@ADDRESS>, 2021.
#
#, fuzzy
msgid ""
msgstr ""
"Project-Id-Version: Python en Español 3.9\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2021-03-19 11:16+0100\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"PO-Revision-Date: 2021-10-16 19:02+0200\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=utf-8\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Generated-By: Babel 2.8.0\n"
"Plural-Forms: nplurals=2; plural=(n != 1);\n"
"Last-Translator: \n"
"Language-Team: \n"
"Language: es\n"
"X-Generator: Poedit 3.0\n"

#: ../Doc/library/graphlib.rst:2
msgid ":mod:`graphlib` --- Functionality to operate with graph-like structures"
msgstr ""

#: ../Doc/library/graphlib.rst:8
msgid "**Source code:** :source:`Lib/graphlib.py`"
msgstr ""
msgstr "**Código fuente:** :fuente:'Lib/graphlib.py'"

#: ../Doc/library/graphlib.rst:20
msgid "Provides functionality to topologically sort a graph of hashable nodes."
msgstr ""
"Proporciona funcionalidad para ordenar topológicamente un gráfico de nodos "
"hashables."

#: ../Doc/library/graphlib.rst:22
msgid ""
Expand All @@ -41,6 +45,15 @@ msgid ""
"topological ordering is possible if and only if the graph has no directed "
"cycles, that is, if it is a directed acyclic graph."
msgstr ""
"Un orden topológico es un orden lineal de los vértices en un gráfico tal que "
"para cada arista dirigida u -> v desde el vértice u hasta el vértice v, el "
"vértice u viene antes del vértice v en el orden. Por ejemplo, los vértices "
"del gráfico pueden representar tareas que se deben realizar, y los bordes "
"pueden representar restricciones que una tarea debe realizarse antes que "
"otra; en este ejemplo, una ordenación topológica es simplemente una "
"secuencia válida para las tareas. Un orden topológico completo es posible si "
"y sólo si el gráfico no tiene ciclos dirigidos, es decir, si es un gráfico "
"acíclico dirigido."

#: ../Doc/library/graphlib.rst:31
msgid ""
Expand Down