libigl v2.5.0
Loading...
Searching...
No Matches
bfs.h
Go to the documentation of this file.
1#ifndef IGL_BFS_H
2#define IGL_BFS_H
3#include "igl_inline.h"
4#include <Eigen/Core>
5#include <vector>
6#include <Eigen/Sparse>
7namespace igl
8{
19 template <
20 typename AType,
21 typename DerivedD,
22 typename DerivedP>
23 IGL_INLINE void bfs(
24 const AType & A,
25 const size_t s,
26 Eigen::PlainObjectBase<DerivedD> & D,
27 Eigen::PlainObjectBase<DerivedP> & P);
28
39 template <
40 typename AType,
41 typename DType,
42 typename PType>
43 IGL_INLINE void bfs(
44 const std::vector<std::vector<AType> > & A,
45 const size_t s,
46 std::vector<DType> & D,
47 std::vector<PType> & P);
49 template <
50 typename AType,
51 typename DType,
52 typename PType>
53 IGL_INLINE void bfs(
54 const Eigen::SparseCompressedBase<AType> & A,
55 const size_t s,
56 std::vector<DType> & D,
57 std::vector<PType> & P);
58}
59#ifndef IGL_STATIC_LIBRARY
60# include "bfs.cpp"
61#endif
62#endif
63
igl_inline.h
IGL_INLINE
#define IGL_INLINE
Definition igl_inline.h:15
igl
Definition AABB.h:17
igl::bfs
void bfs(const AType &A, const size_t s, Eigen::PlainObjectBase< DerivedD > &D, Eigen::PlainObjectBase< DerivedP > &P)
Traverse a directed graph represented by an adjacency list using.