-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinsert_mesh_algorithms.h
More file actions
44 lines (33 loc) · 1.63 KB
/
Copy pathinsert_mesh_algorithms.h
File metadata and controls
44 lines (33 loc) · 1.63 KB
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
/***************************************************************************
insert_mesh_algorithms.h - description
-------------------
begin : Sat May 24 2006
copyright : (C) 2005 by Knut-Helge Vik
email : knuthelv@ifi.uio.no
***************************************************************************/
#ifndef GRAPHALGO_INSERT_MESH_ALGORITHMS_KHV
#define GRAPHALGO_INSERT_MESH_ALGORITHMS_KHV
#include "../simdefs.h"
#include "../treealgs/treestructure.h"
#include "../treealgs/insert_dynamics.h"
#include "../network/group_info.h"
#include "../graphalgs/steiner_set.h"
#include <map>
#include <list>
using namespace std;
using namespace boost;
using namespace TreeAlgorithms;
/*-----------------------------------------------------------------------
namespace GraphAlgorithms
----------------------------------------------------------------------- */
namespace GraphAlgorithms
{
// mesh start functions
bool insertMeshAlgorithm(const GraphN &g, GraphLib::GroupInformation& groupInfo, SteinerPoints& fifoSteiner, int actionVert, int k, DynamicMeshAlgo algo, clock_t &alg_time, uint64_t &cpu_cycles);
clock_t insertMeshAlgorithm(const GraphN &g, GraphLib::GroupInformation& groupInfo, SteinerPoints& fifoSteiner, int actionVert, int k, DynamicMeshAlgo algo);
// k-single-edges
void kInsertMDDL(const GraphN &g, TreeStructure &groupT, int actionVert, int k);
void kInsertMC(const GraphN &g, TreeStructure &groupT, int actionVert, int k);
void kInsertMCandMDDL(const GraphN &g, TreeStructure &groupT, int actionVert, int k);
};
#endif // ...