FMT 0.9.8
Forest management tools for forest planning
Loading...
Searching...
No Matches
FMTgraphdescription.hpp
Go to the documentation of this file.
1/*
2Copyright (c) 2019 Gouvernement du Québec
3
4SPDX-License-Identifier: LiLiQ-R-1.1
5License-Filename: LICENSES/EN/LiLiQ-R11unicode.txt
6*/
7
8#ifndef FMTgraphdescription_H_INCLUDED
9#define FMTgraphdescription_H_INCLUDED
10
12#include "FMTedgeproperties.hpp"
13#include "FMTdevelopment.hpp"
14#include <boost/graph/adjacency_list.hpp>
15#include <boost/graph/adjacency_matrix.hpp>
16#include <boost/graph/labeled_graph.hpp>
17#include <boost/graph/copy.hpp>
18#include <boost/graph/graph_utility.hpp>
19#include <boost/graph/adj_list_serialize.hpp>
20
21
22namespace Graph
23{
24
25 /*typedef boost::adjacency_list< boost::listS,
26 boost::listS,
27 boost::bidirectionalS,
28 FMTvertexproperties,
29 FMTedgeproperties,
30 boost::no_property,
31 boost::listS>FMTadjacency_list;
32
33
34
35 //https://www.boost.org/doc/libs/1_47_0/libs/graph/doc/adjacency_list.html
36
37 typedef boost::graph_traits<FMTadjacency_list>::vertex_descriptor FMTvertex_descriptor;
38 typedef boost::graph_traits<FMTadjacency_list>::edge_descriptor FMTedge_descriptor;
39 typedef boost::graph_traits<FMTadjacency_list>::in_edge_iterator FMTinedge_iterator;
40 typedef boost::graph_traits<FMTadjacency_list>::out_edge_iterator FMToutedge_iterator;
41 typedef boost::graph_traits<FMTadjacency_list>::vertex_iterator FMTvertex_iterator;
42 typedef boost::graph_traits<FMTadjacency_list>::edge_iterator FMTedge_iterator;
43 typedef std::pair<FMToutedge_iterator, FMToutedge_iterator> FMToutedge_pair;
44 typedef std::pair<FMTvertex_iterator,FMTvertex_iterator> FMTvertex_pair;*/
45
46
47}
48
49#endif
Namespace for using/building unidirectional graphs in FMT.
Definition: FMTareaparser.hpp:31