#Zettlr review free

The graph view is currently not available via a prominently placed button. The actual placement of the vertices as well as the distance to other vertices does not have any inherent meaning!! This is very important to remember: Only the edges between the various vertices have meaning, not their positions or distance! Opening the graph view ¶ We utilize a force directed layout (however, not Fruchterman-Reingold, for those who have some experience with network visualizations) that tries to place the different nodes in a way that they don't overlap and that you can see clusters. Under the hood, Zettlr uses the library D3 to facilitate the actual rendering of the graph.

… treat all links as undirected and unweighted.

… create one edge per link from one file to another.

… create one vertex per file that is loaded in Zettlr.

Zettlr now implements a subset of the available features to create a graph.

#Zettlr review free

Feel free to read further online if you're interested! Zettlr's graph implementation ¶ There is much more to networks, but for now, we will leave it to that. A multiplex graph would imply that files can not only be connected by links, but also by, e.g., shared keywords or some other feature.

A link weight could be the amount of times file A links to file B (if you link from several parts of your file, for example).A backlink then also creates the opposing arc from B to A.Every link between two files is represented as an arc (= directed edge) from file A to file B.Each file that is loaded in Zettlr is a vertex.If all of this now sounds very abstract, let us put examples to the definitions: A multiplex graph does not just have one type of edge, but multiple. Finally, a graph can be either simple or multiplex. A graph can also be weighted, in which case its edges will have some number attached to them. the arc from A to B is not the same as the arc from B to A) or undirected (meaning that the edge from A to B also implies the edge from B to A). Furthermore, a graph can be either directed (that is, the arcs between two vertices have a direction, i.e. A cluster of connected vertices within a network is called a component. Vertices can be either connected to a single other vertex (a dyad), to two other vertices (a triad), or more than that. Edges are called arcs when they are directed. A graph view of a personal knowledge management (PKM) database is only loosely related to empirical networks such as social networks, but it can help nevertheless.Ī graph is mathematically defined as a set of vertices (or nodes), which are connected by a set of edges (or links). For a general introduction, we warmly recommend you to read What is the point of a graph view? by Arthur Perret as well as - for a more cautious notion - the article Quo Vadis, PKM? by Hendrik Erz.įirst, let's start with a crash course in network science. They can be very powerful, but they can also act as a Rorschach test where you spot patterns that are not there. Graphs and networks are different kinds of beasts. This can help you spot clusters as they emerge, find ways of connecting separate components, and gain an overview over all of your files. As other applications, Zettlr features a graph view that allows you to view the network that you have created by interlinking your files.