1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
-- Copyright 2012 by Till Tantau
--
-- This file may be distributed an/or modified
--
-- 1. under the LaTeX Project Public License and/or
-- 2. under the GNU Public License
--
-- See the file doc/generic/pgf/licenses/LICENSE for more information
-- @release $Header$
---
-- @section subsection {Hyperedges}
--
-- @end
-- Includes
local declare = require "pgf.gd.interface.InterfaceToAlgorithms".declare
---
declare {
key = "hyper",
layer = -10,
summary = [["
A \emph{hyperedge} of a graph does not connect just two nodes, but
is any subset of the node set (although a normal edge is also a
hyperedge that happens to contain just two nodes). Internally, a
collection of kind |hyper| is created. Currently, there is
no default renderer for hyper edges.
"]],
documentation = [["
\begin{codeexample}[code only]
\graph {
% The nodes:
a, b, c, d;
% The edges:
{[hyper] a,b,c};
{[hyper] b,c,d};
{[hyper] a,c};
{[hyper] d}
};
\end{codeexample}
"]]
}
-- Done
return Hyperedge
|