Connexity graph: Difference between revisions
[checked revision] | [checked revision] |
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
As a reminder, in graph theory, a graph is a | As a reminder, in graph theory, a graph is a pair '''G=(V,E)'''. | ||
'''V''' is the set of vertices or nodes. | '''V''' is the set of vertices or nodes. |
Revision as of 17:22, 12 September 2016
As a reminder, in graph theory, a graph is a pair G=(V,E).
V is the set of vertices or nodes.
E is the set of edges or arcs with each element of E is a pair of element of V.
It is possible to define an oriented graph if you define that the element of E are an oriented pair of vertice.
Here, we just use a simple graph (i. e. without multiple same pair of vertice to define the elements of E).
So, with this definition of graph, we introduce ne notion of connexity. The connexity between two vertices is define by the exitencing of path between this two vertices. A path in a graph is a finite or infinite sequence of edges which connect a sequence of vertices.
In connexity graph, we use this concept of connexity just for two adjacent vertices, i. e. two vertices linked by an edge.
More simply, we use the edges two define a relation of connexity between the concept that modelize the vertice.
Back To | Previous Chapter | Next Chapter |
---|---|---|
RTM Modelling Concepts | - | Core elements |