@xamidi/interactive-svg-graphs (repository)
The following images are interactive Scalable Vector Graphics (.svg) files that include animations and hyperlinks. I embedded these images via the HTML tag <object>. However, interactive components do not work in GitHub Markdown, because <img> is insufficient and even local embeddings with tags such as <object>, <embed> or <iframe> are currently unsupported by GitHub Flavored Markdown. But they should work on the website. In case you do not see vertices, edges and labels changing their colors when hovering components with your mouse cursor on the website, then your browser is outdated and doesn’t support current SVG or CSS specifications.
All vector images shown below contain hyperlinks and use CSS to animate their elements based on user interaction. I created them with the intent to use them in .md (Markdown) files and discussions on GitHub, but then realized that no features are supported to actually embed them (meaning interactive elements do not operate there).
You can interact with the full variants on GitHub Pages or by viewing them in their own browser tab.
Please submit your preferences to my poll! (Votes are anonymous.)
Hints to handle the animations 
- Move your mouse cursor over different elements to reveal or highlight all similar elements.
- The light bulb (💡) does this for everything at once.
1. Minimalistic variant [Direct link] [Source code on GitHub]
2. Fully labelled variant [Direct link] [Source code on GitHub]
3. Colorful variant [Direct link] [Source code on GitHub]
What am I actually looking at?
These are directed graphs, more specifically 7-vertex cliques but with directed edges. The images are symmetric under 60° rotations (apart from labels and colors), and arranged as regular hexagons.
Vertices are meant to represent the axioms of all seven minimal 1-base proof systems for classical propositional logic with only →,¬ (“implies” and “not”) as connectives. Edge labels are meant to be updated to the smallest known proof lengths of deriving one axiom from another, once I started a corresponding proof minimization challenge. I plan to do this after the current challenge (for completeness proofs in the same systems) reached a more mature state.
Such graphs could also be useful to illustrate deterministic finite automata, or similar.