pynguin
NetworkX
pynguin | NetworkX | |
---|---|---|
11 | 61 | |
1,200 | 14,200 | |
1.0% | 0.9% | |
8.2 | 9.6 | |
11 days ago | 4 days ago | |
Python | Python | |
MIT License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
pynguin
-
There is framework for everything.
https://swagger.io/specification/ https://github.com/se2p/pynguin
-
Supposed to create tests for a massive project, how should I go about it?
I would use black to reformat this, then, if you can't refactor/rewrite (which is a lot of work!) I would try automated test generation via something like pynguin or fuzzing. I mean … this is not going to be a reliable solution anyways if the codebase is like that. So I would go in a direction that I find interesting to learn about and that could be helpful for the project. That would be generating tests and doing fuzzing. In the end you should run some linters anyways so that you can justify your results and show that the task is not in the scope of an internship and needs extensive refactoring.
-
Klara: Python automatic test generations and static analysis library
The main difference that Klara bring to the table, compared to similar tool like pynguin and Crosshair is that the analysis is entirely static, meaning that no user code will be executed, and you can easily extend the test generation strategy via plugin loading (e.g. the options arg to the Component object returned from function above is not needed for test coverage).
-
Does anybody know a simple algorithm for generating unit tests given a function's code?
Automated White-box test generation software: * https://github.com/EMResearch/EvoMaster -- for integration tests. * https://github.com/se2p/pynguin, https://pynguin.readthedocs.io/en/latest/user/quickstart.html -- unit test generation for python
- se2p/pynguin Pynguin, the PYthoN General UnIt test geNerator, is a tool that allows developers to generate unit tests automatically.
-
Hacker News top posts: Jun 1, 2021
Pynguin – Generate Python unit tests automatically\ (60 comments)
- Pynguin – Generate Python unit tests automatically
- Pynguin – Allow developers to generate Python unit tests automatically
NetworkX
-
Routes to LANL from 186 sites on the Internet
Built from this data... https://github.com/networkx/networkx/blob/main/examples/grap...
-
The Hunt for the Missing Data Type
I think one of the elements that author is missing here is that graphs are sparse matrices, and thus can be expressed with Linear Algebra. They mention adjacency matrices, but not sparse adjacency matrices, or incidence matrices (which can express muti and hypergraphs).
Linear Algebra is how almost all academic graph theory is expressed, and large chunks of machine learning and AI research are expressed in this language as well. There was recent thread here about PageRank and how it's really an eigenvector problem over a matrix, and the reality is, all graphs are matrices, they're typically sparse ones.
One question you might ask is, why would I do this? Why not just write my graph algorithms as a function that traverses nodes and edges? And one of the big answers is, parallelism. How are you going to do it? Fork a thread at each edge? Use a thread pool? What if you want to do it on CUDA too? Now you have many problems. How do you know how to efficiently schedule work? By treating graph traversal as a matrix multiplication, you just say Ax = b, and let the library figure it out on the specific hardware you want to target.
Here for example is a recent question on the NetworkX repo for how to find the boundary of a triangular mesh, it's one single line of GraphBLAS if you consider the graph as a matrix:
https://github.com/networkx/networkx/discussions/7326
This brings a very powerful language to the table, Linear Algebra. A language spoken by every scientist, engineer, mathematician and researcher on the planet. By treating graphs like matrices graph algorithms become expressible as mathematical formulas. For example, neural networks are graphs of adjacent layers, and the operation used to traverse from layer to layer is matrix multiplication. This generalizes to all matrices.
There is a lot of very new and powerful research and development going on around sparse graphs with linear algebra in the GraphBLAS API standard, and it's best reference implementation, SuiteSparse:GraphBLAS:
https://github.com/DrTimothyAldenDavis/GraphBLAS
SuiteSparse provides a highly optimized, parallel and CPU/GPU supported sparse Matrix Multiplication. This is relevant because traversing graph edges IS matrix multiplication when you realize that graphs are matrices.
Recently NetworkX has grown the ability to have different "graph engine" backends, and one of the first to be developed uses the python-graphblas library that binds to SuiteSparse. I'm not a directly contributor to that particular work but as I understand it there has been great results.
-
Build the dependency graph of your BigQuery pipelines at no cost: a Python implementation
In the project we used Python lib networkx and a DiGraph object (Direct Graph). To detect a table reference in a Query, we use sqlglot, a SQL parser (among other things) that works well with Bigquery.
- NetworkX – Network Analysis in Python
-
Custom libraries and utility tools for challenges
If you program in Python, can use NetworkX for that. But it's probably a good idea to implement the basic algorithms yourself at least one time.
-
Google open-sources their graph mining library
For those wanting to play with graphs and ML I was browsing the arangodb docs recently and I saw that it includes integrations to various graph libraries and machine learning frameworks [1]. I also saw a few jupyter notebooks dealing with machine learning from graphs [2].
Integrations include:
* NetworkX -- https://networkx.org/
* DeepGraphLibrary -- https://www.dgl.ai/
* cuGraph (Rapids.ai Graph) -- https://docs.rapids.ai/api/cugraph/stable/
* PyG (PyTorch Geometric) -- https://pytorch-geometric.readthedocs.io/en/latest/
--
1: https://docs.arangodb.com/3.11/data-science/adapters/
2: https://github.com/arangodb/interactive_tutorials#machine-le...
-
org-roam-pygraph: Build a graph of your org-roam collection for use in Python
org-roam-ui is a great interactive visualization tool, but its main use is visualization. The hope of this library is that it could be part of a larger graph analysis pipeline. The demo provides an example graph visualization, but what you choose to do with the resulting graph certainly isn't limited to that. See for example networkx.
What are some alternatives?
CrossHair - An analysis tool for Python that blurs the line between testing and type systems.
Numba - NumPy aware dynamic Python compiler using LLVM
EvoMaster - The first open-source AI-driven tool for automatically generating system-level test cases (also known as fuzzing) for web/enterprise applications. Currently targeting whitebox and blackbox testing of Web APIs, like REST, GraphQL and RPC (e.g., gRPC and Thrift).
Dask - Parallel computing with task scheduling
klara - Automatic test case generation for python and static analysis library
julia - The Julia Programming Language
icontract-hypothesis - Combine contracts and automatic testing.
RDKit - The official sources for the RDKit library
methods2test - methods2test is a supervised dataset consisting of Test Cases and their corresponding Focal Methods from a set of Java software repositories
snap - Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.
code - Example application code for the python architecture book
SymPy - A computer algebra system written in pure Python