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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
(***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(***********************************************************************)
(*
** ATS/Postiats - Unleashing the Potential of Types!
** Copyright (C) 2011-2016 Hongwei Xi, ATS Trustful Software, Inc.
** All rights reserved
**
** ATS is free software; you can redistribute it and/or modify it under
** the terms of the GNU GENERAL PUBLIC LICENSE (GPL) as published by the
** Free Software Foundation; either version 3, or (at your option) any
** later version.
**
** ATS 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 General Public License
** for more details.
**
** You should have received a copy of the GNU General Public License
** along with ATS; see the file COPYING. If not, please write to the
** Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)
(* ****** ****** *)
(* Author: Hongwei Xi *)
(* Start time: November, 2016 *)
(* Authoremail: hwxiATcsDOTbuDOTedu *)
(* ****** ****** *)
//
#define
ATS_PACKNAME
"ATSLIB.libats.BUCS320.GraphSearch"
//
(* ****** ****** *)
abstype node_type = ptr
absvtype nodelst_vtype = ptr
(* ****** ****** *)
typedef node = node_type
vtypedef nodelst = nodelst_vtype
(* ****** ****** *)
//
extern
fun{}
node_get_neighbors(nx: node): nodelst
//
(* ****** ****** *)
//
extern
fun{}
process_node(nx: node): bool
//
(* ****** ****** *)
//
extern
fun{}
theSearchStore_insert(node): void
extern
fun{}
theSearchStore_insert_lst(nodelst): void
//
(* ****** ****** *)
//
extern
fun{}
theSearchStore_choose((*void*)): Option_vt(node)
//
(* ****** ****** *)
//
extern
fun{}
GraphSearch(): void
//
(* ****** ****** *)
implement
{}(*tmp*)
GraphSearch
((*void*)) = let
//
fun
search
(
// argless
): void = let
//
val
opt =
theSearchStore_choose<>()
//
in
//
case+ opt of
| ~None_vt() => ()
| ~Some_vt(nx) => let
val cont = process_node<>(nx)
in
if cont
then let
val nxs =
node_get_neighbors<>(nx)
// end of [val]
in
theSearchStore_insert_lst<>(nxs); search((*void*))
end // end of [then]
// end of [if]
end (* end of [Some_vt] *)
//
end (* end of [search] *)
//
in
search((*void*))
end // end of [GraphSearch]
(* ****** ****** *)
(* end of [GraphSearch.dats] *)
|
