#include <iostream>
#include <iterator>
#include <tuple>
#include <vector>
#include <algorithm>
Go to the source code of this file.
◆ _FCALL
◆ set_graph_add_set_()
| void _FCALL set_graph_add_set_ |
( |
int * | set_id, |
|
|
int * | set_list, |
|
|
int * | list_size ) |
Definition at line 194 of file set_graph.cpp.
194 {
195
196
197
198
199
200
201
202
203
204
205
206 set_of_set.init_edge(*set_id, *list_size, set_list);
207 }
◆ set_graph_clean_()
| void _FCALL set_graph_clean_ |
( |
| ) |
|
◆ set_graph_sort_()
| void _FCALL set_graph_sort_ |
( |
int * | dependancy_list, |
|
|
int * | check ) |
Definition at line 210 of file set_graph.cpp.
210 {
211
212
213
214
215
216
217
218
219 *check = 0;
220 set_of_set.dependancy_sort(dependancy_list,check);
221
222 }
◆ set_of_set