Overview

Chord

In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle.

If the user configures the component by choosing the two following properties:

myArcs for "Arcs", a simple array of N Strings
myLinks for "Links", an array of N arrays each containing N non-negative numbers (an NxN matrix)

The "Links" matrix represents how much is flowing from one arc to another or to itself, as illustrated in the follwing table:

	Dest.: A	Dest.: B	Dest.: C
Source: A	A --> A	A --> B	A --> C
Source: B	B --> A	B --> B	B --> C
Source: C	C --> A	C --> B	C --> C

upon receiving the following message:

 msg.payload = {
    "myArcs": ["A", "B", "C"],

    "myLinks": [
      [0, 2, 2],
      [1, 0, 2],
      [1, 1, 0]
    ]
  }
}
return msg;

and the diagram displays. There are three arcs, none of which have self-flows except for "A" which has one with a value of 5. From each arc departs a flow towards all the other arcs.