graphtage
communities
graphtage | communities | |
---|---|---|
12 | 12 | |
2,320 | 698 | |
0.3% | - | |
8.3 | 4.0 | |
about 2 months ago | 6 months ago | |
Python | Python | |
GNU Lesser General Public License v3.0 only | MIT License |
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.
graphtage
-
Pijul: Version-Control Post-Git • Goto 2023
I'm not familiar with Pijul, and haven't finished watching this presentation, but IME the problems with modern version control tools is that they still rely on comparing lines of plain text, something we've been doing for decades. Merge conflicts are an issue because our tools are agnostic about the actual content they're tracking.
Instead, the tools should be smarter and work on the level of functions, classes, packages, sentences, paragraphs, or whatever primitive makes sense for the project and file that is being changed. In the case of code bases, they need to be aware of the language and the AST of the program. For binary files, they need to be aware of the file format and its binary structure. This would allow them to show actually meaningful diffs, and minimize the chances of conflicts, and of producing a corrupt file after an automatic merge.
There has been some research in this area, and there are a few semantic diffing tools[1,2,3], but I'm not aware of this being widely used in any VCS.
Nowadays, with all the machine learning advances, the ideal VCS should also use ML to understand the change at a deeper level, and maybe even suggest improvements. If AI can write code for me, it could surely understand what I'm trying to do, and help me so that version control is entirely hands-free, instead of having to fight with it, and be constantly aware of it, as I have to do now.
I just finished watching the presentation, and Pijul seems like an iterative improvement over Git. Nothing jumped out at me like a killer feature that would make me want to give it a try. It might be because the author focuses too much on technical details, instead of taking a step back and rethinking what a modern VCS tool should look like today.
[1]: https://semanticdiff.com/
[2]: https://github.com/trailofbits/graphtage
[3]: https://github.com/GumTreeDiff/gumtree
- graphtage - A semantic diff utility and library for tree-like files such as JSON, JSON5, XML, HTML, YAML, and CSV.
-
comparing two jsons element-wise
Vielleicht mal https://github.com/trailofbits/graphtage abchecken
-
Hacker News top posts: Feb 27, 2021
Graphtage: A semantic diff utility for JSON, HTML, YAML, CSV, etc\ (42 comments)
- Graphtage: A semantic diff utility for JSON, HTML, YAML, CSV, etc
communities
-
I made a graph neural network specifically for graphs with community structure
I made a tool for plotting graphs with community structure. You can check it out here.
-
[OC] Algorithmically organizing a social network into cliques
A few people are asking what this is a visualization of. OP's graphs look very similar to an example of the Louvain Method shown in the library's documentation. The Louvain Method is a community detection algorithm used on network graphs. It works by iteratively optimizing modularity of the graph. Modularity is a measure of the density of the number of edges (lines between nodes) that fall within a given group/cluster compared to what would be expected from a random distribution of edges throughout the graph.
-
Algorithmically organizing a social network into cliques
I made this visualization with: https://github.com/shobrook/communities
- I made Communities: a library of clustering algorithms for network graphs (link in comments)
- [P] I made Communities: a library of clustering algorithms for network graphs (link in comments)
- I made a library for organizing social networks into cliques (link in comments)
- [P] I made communities: a library for detecting and visualizing clusters in network graphs (link in comments)
- I made 'communities' – a library of clustering algorithms for graphs
- I made 'communities' – a library for detecting communities in graphs, built on numpy
- [Project] I made a lightweight Python library for graph clustering
What are some alternatives?
bit - Bit is a modern Git CLI
pytextrank - Python implementation of TextRank algorithms ("textgraphs") for phrase extraction
visual-dom-diff - Highlight differences between two DOM trees.
leidenalg - Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
webdiff - Two-column web-based git difftool
libmaths - A Python library created to assist programmers with complex mathematical functions
gqlalchemy - GQLAlchemy is a library developed with the purpose of assisting in writing and running queries on Memgraph. GQLAlchemy supports high-level connection to Memgraph as well as modular query builder.
NetworkX - Network Analysis in Python
GJSON - Get JSON values quickly - JSON parser for Go
traph - A terminal/cmd graph algorithm visualiser
arrow - 🏹 Better dates & times for Python
jsondiff - Diff JSON and JSON-like structures in Python