Graphs-and-Trees

This repository contains Python implementations of graphs and trees with some problems solved, intended for educational purposes.

Files

• 8Queens.py: Implementation of the Eight Queens problem.
• A-Star.py: Implementation of the A* algorithm for pathfinding.
• BestFirstSearch.py: Implementation of the Best-First Search algorithm.
• BinarySearchTree.py: Implementation of the Binary Search Tree data structure.
• DistancesLetters.py: Implementation of a program that calculates the distance between letters in a the file matrix.txt.
• GenericTree.py: Implementation of a generic tree data structure.
• Graph_DFS-BFS.py: Implementation of depth-first search and breadth-first search algorithms for graphs.
• RandomWorld-HorseMovement.py: Implementation of a program that generates a random world and performs horse movement from a starting position.
• SegmentTree.py: Implementation of the Segment Tree data structure.
• SudokuSolver.py: Implementation of a program that solves Sudoku puzzles.
• Tree.py: Implementation of a Tree data structure.
• Trie.py: Implementation of a Trie data structure.

Usage

Each file contains the implementation of a specific graph or tree data structure, as well as the implementation of a related problem or algorithm. To use any of the programs, simply run the corresponding Python file. Note that some programs may require additional input files or user input. Comments are in Spanish.

Contribution

Contributions to this repository are welcome. If you have any suggestions for improvements or additional implementations, feel free to open an issue or submit a pull request.