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
|
(* Graph viewer
* Copyright (C) 2010 Jérôme Vouillon
* Laboratoire PPS - CNRS Université Paris Diderot
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*)
type kind =
[ `Graph
| `Digraph
]
type attr_type =
[ `Graph
| `Edge
| `Node
]
type attributes = (string * string) list
type node =
{ name : string
; port : string option
}
type graph =
{ graph_name : string option
; body : statement list
}
and compound = [ `Node of node | `Graph of graph ] list * attributes
and statement =
[ `Attributes of attr_type * attributes
| `Compound of compound
]
type t =
{ kind : kind
; strict : bool
; graph : graph
}
|
