👉 In linguistics and computer science, a cojoin (also known as a co-join) in a directed graph is an edge that connects two nodes. It represents an event or action that occurs between two nodes in the graph, where one node is joined to the other by the edge. For example, consider a directed graph with three nodes A, B, and C connected by an edge (AB). In this case, "cojoin" would refer to the event of A joining B,
