rovaniemi / osm-graph-parserLinks
Java program that parses OSM XML files into a json graph representation.
☆12Updated 8 years ago
Alternatives and similar repositories for osm-graph-parser
Users that are interested in osm-graph-parser are comparing it to the libraries listed below
Sorting:
- Binary Decision Diagrams (BDDs) in pure Python and Cython wrappers of CUDD, Sylvan, and BuDDy☆215Updated 3 weeks ago
- A toolkit for SAT-based prototyping in Python☆445Updated 3 weeks ago
- ☆62Updated last year
- Simulator + benchmark suite for Micro Aerial Vehicle design.☆67Updated 2 years ago
- CaDiCaL SAT Solver☆512Updated this week
- A solution for a simple version of the exam timetabling CSP problem.☆11Updated 3 years ago
- Automated Reasoning in Nonlinear Theories of Reals☆179Updated 2 weeks ago
- Multi-terminal and Edge-valued Decision Diagram LibrarY☆15Updated last week
- A minimalistic and high-performance SAT solver☆1,126Updated last year
- Temporal Logic Extractor☆11Updated 8 years ago
- ☆27Updated last year
- pySMT: A library for SMT formulae manipulation and solving☆624Updated 4 months ago
- ☆305Updated 2 months ago
- Approximate Model Counter☆82Updated 3 weeks ago
- Exact and approximate algorithms for processing k-SPwLO queries.☆20Updated 2 years ago
- mETRICS - rEproducible sofTware peRformance analysIs in perfeCt Simplicity☆11Updated 7 months ago
- The #SAT solver sharpSAT☆63Updated 3 years ago
- ☆22Updated 4 years ago
- TChecker is an open-source verification tool for timed automata☆24Updated last month
- ☆17Updated 3 years ago
- Thesis class for undergraduate theses at the University of Athens☆41Updated 2 years ago
- ☆598Updated 2 months ago
- An advanced SAT solver☆906Updated last week
- Search-based test generation toolbox written in Python☆15Updated 2 months ago
- CUDD Decision Diagram Package☆150Updated 3 weeks ago
- LIGHTER-R is a tool to optimally implement a given 4 × 4 SBox using logic gates from a reversible logic library☆13Updated 3 months ago
- SAT Solver SATCH☆120Updated 3 years ago
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆15Updated 6 months ago
- XCSP3 Core Parser in C++☆19Updated last month
- A fast and simple automata library☆31Updated this week