# Biblioteca *algoritmia*
Implementada en Python 3. Necesita Python 3.12 o superior.
Utilizada en dos asignaturas de la Universitat Jaume I de Castelló:
* EI1022: Grado en Ingeniería Informática.
* MT1022: Grado en Matemática Computacional.
## Contenido
Estructuras de datos:
* Colas: Fifo, Lifo
* Listas enlazadas: LinkedList
* Grafos: Digraph, UndirectedGraph
* Montículos: MinHeap, MaxHeap
* Diccionarios de prioridad: MinHeapMap, MaxHeapMap
* Conjuntos disjuntos: MFSet
Algoritmos sobre grafos:
* Recorridos de vértices y aristas
* Componentes conexos
* Árbol de recubrimiento mínimo
* Camino más corto
* Algoritmo de Dijkstra
Esquemas algorítmicos:
* Búsqueda con retroceso (*backtracking*)
* Ramificación y acotación (*brand and bound*)
* Divide y vencerás (*divide and conquer*)
* Reduce y vencerás (*reduce and conquer*)
Problemas:
* Mochila (*Knapsack*)
* Cambio de moneda (*Coin change*)
* Empaquetado (*Bin packing*)
* Viajante (*Travelling salesman*)
* N-reinas (*N-queens*)
* Coloreado de grafos (*Graph coloring*)
* Voraces exactos: MST (Kruskal y Prim), mochila fraccionaria
Raw data
{
"_id": null,
"home_page": null,
"name": "algoritmia",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.12",
"maintainer_email": "David Llorens <dllorens@uji.es>",
"keywords": "data structures, greedy, divide and conquer, dynamic programming, branch and bound",
"author": "David Llorens - Andr\u00e9s Marzal",
"author_email": null,
"download_url": "https://files.pythonhosted.org/packages/a8/b4/6205ae55bd1f32996280db0e1c921f5a055665ef045628b584ce41768eeb/algoritmia-4.0.2.tar.gz",
"platform": null,
"description": "# Biblioteca *algoritmia*\n\nImplementada en Python 3. Necesita Python 3.12 o superior.\n\nUtilizada en dos asignaturas de la Universitat Jaume I de Castell\u00f3:\n* EI1022: Grado en Ingenier\u00eda Inform\u00e1tica.\n* MT1022: Grado en Matem\u00e1tica Computacional.\n\n## Contenido\n\nEstructuras de datos:\n * Colas: Fifo, Lifo\n * Listas enlazadas: LinkedList\n * Grafos: Digraph, UndirectedGraph\n * Mont\u00edculos: MinHeap, MaxHeap\n * Diccionarios de prioridad: MinHeapMap, MaxHeapMap\n * Conjuntos disjuntos: MFSet\n\nAlgoritmos sobre grafos:\n * Recorridos de v\u00e9rtices y aristas\n * Componentes conexos\n * \u00c1rbol de recubrimiento m\u00ednimo\n * Camino m\u00e1s corto\n * Algoritmo de Dijkstra\n\nEsquemas algor\u00edtmicos:\n * B\u00fasqueda con retroceso (*backtracking*)\n * Ramificaci\u00f3n y acotaci\u00f3n (*brand and bound*)\n * Divide y vencer\u00e1s (*divide and conquer*)\n * Reduce y vencer\u00e1s (*reduce and conquer*)\n\nProblemas:\n * Mochila (*Knapsack*)\n * Cambio de moneda (*Coin change*)\n * Empaquetado (*Bin packing*)\n * Viajante (*Travelling salesman*)\n * N-reinas (*N-queens*)\n * Coloreado de grafos (*Graph coloring*)\n * Voraces exactos: MST (Kruskal y Prim), mochila fraccionaria\n",
"bugtrack_url": null,
"license": "GNU Affero General Public License v3",
"summary": "A library of algorithms and data structures. Used in course EI1022/MT122 (Universitat Jaume I de Castell\u00f3)",
"version": "4.0.2",
"project_urls": {
"Source": "https://github.com/DavidLlorens/algoritmia",
"changelog": "https://github.com/DavidLlorens/algoritmia/blob/main/CHANGELOG.md",
"homepage": "https://github.com/DavidLlorens/algoritmia"
},
"split_keywords": [
"data structures",
" greedy",
" divide and conquer",
" dynamic programming",
" branch and bound"
],
"urls": [
{
"comment_text": null,
"digests": {
"blake2b_256": "55ef82a5f7c1240086f610bb6b9f1a5928ac02a4af8f7e2037addb21945bfad1",
"md5": "3e352e85a7367da3003c271f3adf7c7b",
"sha256": "a5db8e7c1b6920a0ff35d6444b24f22ea6268b8cc0b54ae6d23f30e98cb571a7"
},
"downloads": -1,
"filename": "algoritmia-4.0.2-py3-none-any.whl",
"has_sig": false,
"md5_digest": "3e352e85a7367da3003c271f3adf7c7b",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.12",
"size": 105171,
"upload_time": "2025-10-11T10:26:14",
"upload_time_iso_8601": "2025-10-11T10:26:14.291873Z",
"url": "https://files.pythonhosted.org/packages/55/ef/82a5f7c1240086f610bb6b9f1a5928ac02a4af8f7e2037addb21945bfad1/algoritmia-4.0.2-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": null,
"digests": {
"blake2b_256": "a8b46205ae55bd1f32996280db0e1c921f5a055665ef045628b584ce41768eeb",
"md5": "45b6b94ef63810674ddddcaf6daf517d",
"sha256": "b92751917a5baf90ea73be4e8262e24e57879c59abf9888d5c769bb1535109c0"
},
"downloads": -1,
"filename": "algoritmia-4.0.2.tar.gz",
"has_sig": false,
"md5_digest": "45b6b94ef63810674ddddcaf6daf517d",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.12",
"size": 86746,
"upload_time": "2025-10-11T10:26:15",
"upload_time_iso_8601": "2025-10-11T10:26:15.947098Z",
"url": "https://files.pythonhosted.org/packages/a8/b4/6205ae55bd1f32996280db0e1c921f5a055665ef045628b584ce41768eeb/algoritmia-4.0.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2025-10-11 10:26:15",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "DavidLlorens",
"github_project": "algoritmia",
"travis_ci": false,
"coveralls": false,
"github_actions": false,
"lcname": "algoritmia"
}
JSON
