Networks are the basic data structure in BeGraph. A network is a set of N entities called nodes, related by a set of L links that represent binary relationships. In a more mathematical notation, networks are called graphs and nodes/links are denoted by vertices/edges. Nodes and links can have associated properties, either imported from a Datasource or calculated with BeGraph. Nodes are always identified with a node property called NodeLabel.
The networks treated in BeGraph have two main properties:
The following figure shows an undirected network (a), part of a directed network (b) and two nodes with parallel links and selfloops (c):


Directed links are drawn indicating the directionality with arrow tips:


The books Network Science, Cambridge University Press, 2016. ISBN: 9781107076266, by AlbertLászló Barabási and Networks, an Introduction, Oxford University Press, 2010, ISBN:9780199206650 by Mark Newmann are excellent references to dig further into the field of complex networks.