Loading repository data…
eqfinney / repository
Breadth-first search based web crawler for HTML scraping. The code is written using Python's asyncio module to make it faster and more generalizable than a previous synchronous version.
Author: Emily Quinn Finney Version: 2.0
In this package I implemented an asynchronous breadth first search based web crawler/scraper as part of my time at the Recurse Center (https://www.recurse.com/). The package relies primarily on Python's asyncio and Beautiful Soup libraries.
While writing this code, I tested two different methods of object-oriented software design.
Version 1.0 was written recursively, and was not implemented asynchronously.
To test the code, you will need pytest installed. Then type the following into the terminal:
pytest -v -s test_web_crawler_{$TEST_MODULE}.py
Last edited 04/05/2017
Selected from shared topics, language and repository description—not editorial ratings.
garrethlee /
A Python-based application demonstrating various search algorithms, namely Depth-First Search (DFS), Breadth-First Search (BFS), and A* Search (Manhattan Distance Heuristic)
AlexJakin /
Graph theory algorithm python implementation，which has the base class of the adjacency matrix of the graph and the ajdacency table,depth-first search (pre-order and post-order) and breadth-first search, in addition to the implementation of various application aspect of the graph ,Hamiltonian graph, directed graph Algorithm, the shortest path algorithm, Euler loop and Euler path, network flow, matching problem, etc.
shimarisuu /
breadth-first search based shortest path finding algorithm in Rush Hour game
Azeemaj101 /
A console python application that searches for file(s) in Windows based on the string input using The breadth first search algorithm.
abdullah7701 /
this project is based on python programming using GUI tkinter have all searches in Artificial Intelligence Uninformed Search • Breadth First Search • Depth First Search • Depth Limited • Iterative Deepening • Uniform Cost Search • Bidirectional Search Informed Search • Best First Search • A* Search
RafaelaMlucca /
This project is a Python-based desktop application designed to explore, visualize, and compare classical search algorithms, including Breadth-First Search (BFS), Depth-First Search (DFS), and A* (using Manhattan and Euclidean heuristics).