dfs.h File Reference

#include "igl_inline.h"
#include <Eigen/Core>
#include <vector>
#include "dfs.cpp"

Go to the source code of this file.

Namespaces
namespace	igl

Functions
template<typename AType , typename DerivedD , typename DerivedP , typename DerivedC >
void	igl::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.
template<typename AType , typename DType , typename PType , typename CType >
void	igl::dfs (const std::vector< std::vector< AType > > &A, const size_t s, std::vector< DType > &D, std::vector< PType > &P, std::vector< CType > &C)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.