libigl v2.5.0
Loading...
Searching...
No Matches
dfs.h
Go to the documentation of this file.
1#ifndef IGL_DFS_H
2#define IGL_DFS_H
3#include "igl_inline.h"
4#include <Eigen/Core>
5#include <vector>
6namespace igl
7{
20 template <
21 typename AType,
22 typename DerivedD,
23 typename DerivedP,
24 typename DerivedC>
25 IGL_INLINE void dfs(
26 const std::vector<std::vector<AType> > & A,
27 const size_t s,
28 Eigen::PlainObjectBase<DerivedD> & D,
29 Eigen::PlainObjectBase<DerivedP> & P,
30 Eigen::PlainObjectBase<DerivedC> & C);
32 template <
33 typename AType,
34 typename DType,
35 typename PType,
36 typename CType>
37 IGL_INLINE void dfs(
38 const std::vector<std::vector<AType> > & A,
39 const size_t s,
40 std::vector<DType> & D,
41 std::vector<PType> & P,
42 std::vector<CType> & C);
43
44}
45#ifndef IGL_STATIC_LIBRARY
46# include "dfs.cpp"
47#endif
48#endif
igl_inline.h
IGL_INLINE
#define IGL_INLINE
Definition igl_inline.h:15
igl
Definition AABB.h:17
igl::dfs
void dfs(const std::vector< std::vector< AType > > &A, const size_t s, Eigen::PlainObjectBase< DerivedD > &D, Eigen::PlainObjectBase< DerivedP > &P, Eigen::PlainObjectBase< DerivedC > &C)
Traverse a directed graph represented by an adjacency list using depth first search.