41 | | If every item can be devided into its parts and every part can be an item itself, then we need to define a role for each part. We need to clearify if the role of an item |
| 41 | If an item can be the result of a subset of other items and every item again can be part of other items itself, then we need to define a role for each item in its relationship to other items. The role can be ''''whole'''' or ''''part''''. |
| 42 | |
| 43 | |
| 44 | == Graph - Node - Edge == |
| 45 | |
| 46 | Graph (from wikipedia): |
| 47 | |
| 48 | ''"In mathematics, a graph is a representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges. |
| 49 | ... |
| 50 | The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this is an undirected graph, because if person A shook hands with person B, then person B also shook hands with person A. On the other hand, if the vertices represent people at a party, and there is an edge from person A to person B when person A knows of person B, then this graph is directed, because knowledge of someone is not necessarily a symmetric relation (that is, one person knowing another person does not necessarily imply the reverse; for example, many fans may know of a celebrity, but the celebrity is unlikely to know of all their fans). This latter type of graph is called a directed graph and the edges are called directed edges or arcs. Vertices are also called nodes or points, and edges are also called lines or arcs. Graphs are the basic subject studied by graph theory. The word "graph" was first used in this sense by J.J. Sylvester in 1878. |
| 51 | ... |
| 52 | In mathematics, a multigraph or pseudograph is a graph which is permitted to have multiple edges, (also called "parallel edges"[1]), that is, edges that have the same end nodes. Thus two vertices may be connected by more than one edge. |
| 53 | ... |
| 54 | There are two distinct notions of multiple edges. One says that, as in graphs without multiple edges, the identity of an edge is defined by the nodes it connects, but the same edge can occur several times between these nodes. Alternatively, one defines edges to be first-class entities like nodes, each having its own identity independent of the nodes it connects."'' |
| 55 | |
| 56 | ''In DeepaMehta two items that are linked with each other share an ''''association'''' which is seen to be a node itself.'' |
| 57 | |