project.h File Reference

#include <linalg.h>
#include <limits>
#include <list.h>

Include dependency graph for project.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	spams::Graph< T >
class	spams::GraphPath< T, Int >
struct	spams::GraphPathStruct< T >
struct	spams::GraphStruct< T >
class	spams::MaxFlow< T >
class	spams::MinCostFlow< Int >
struct	spams::Path< Int >
class	spams::Tree_Seq< T >
struct	spams::TreeStruct< T >

Namespaces
	spams

Macros
#define	EPSILON_MAXFLOW   1e-10

Functions
template<typename T >
bool	spams::compare_abs (T first, T second)
template<typename T >
T	spams::project_tree_l1 (T *variables, const int n, const T lambda)

Variables
bool	spams::cap_heuristic = true
bool	spams::gap_heuristic = true
bool	spams::global_heuristic = true
int	spams::num_gap_relabels
int	spams::num_global_relabels
int	spams::num_pushes
int	spams::num_relabels
bool	spams::price_heuristic = true
bool	spams::price_refine_heuristic = false
Timer	spams::tglobal1
Timer	spams::tglobal2
Timer	spams::tglobal3

Macro Definition Documentation

#define EPSILON_MAXFLOW   1e-10

Definition at line 26 of file project.h.

Referenced by spams::MaxFlow< T >::check_flow(), spams::MaxFlow< T >::component_relabelling(), spams::MaxFlow< T >::discharge(), spams::Graph< T >::dual_norm_inf(), spams::MaxFlow< T >::global_relabelling(), spams::MaxFlow< T >::perform_maxflow(), spams::MaxFlow< T >::perform_maxflow_component(), spams::Graph< T >::proximal_operator(), and spams::MaxFlow< T >::splitComponent().