Info graphs solely consists of one type of primitive which is called Info Triple. An Info Triple can be seen as an special kind of edge. It consists of three vertices that is, the two ends and the edge's own vertex, the Edge Vertex.
Being able to treat the edge as a vertex has an advantage when it comes to modeling in detail. It means that every time an edge is made, a new possible vertex is added to the graph, and hence a new possibility for making the data more detailed.
The Info Triple consists of 3 identifying number called ID1, ID2 and ID3.
ID3 is the ID for the Edge Vertex and is also called the triple ID.
ID1 and ID2 represents the objects that are in a relationship.
As the Info Graph is not a directed graph, ID1 and ID2 are interchangeable.