#include <Graph.hpp>

Inheritance diagram for minimize_color_alteration_and_length< graph_t >:

Collaboration diagram for minimize_color_alteration_and_length< graph_t >:

Public Types
typedef graph_t::node_t	node_t

Public Types inherited from Dikjstra< graph_t, policy_t >
typedef graph_t::node_t	node_t

typedef graph_t::neighborhood_t::const_iterator	edge_iter_t

Public Member Functions
	minimize_color_alteration_and_length (const graph_t &G)

Public Member Functions inherited from Dikjstra< graph_t, policy_t >
bool	operator() (node_t a, node_t b) const

void	print_path (std::ostream &os, node_t i) const

void	compute_with_root (node_t new_root)

Friends
class	Dikjstra< graph_t, minimize_color_alteration_and_length< graph_t > >

Additional Inherited Members
Public Attributes inherited from Dikjstra< graph_t, policy_t >
std::vector< std::vector< edge_iter_t > >	paths

std::vector< node_t >	root_per_path

std::vector< size_t >	distance_policy

Protected Member Functions inherited from Dikjstra< graph_t, policy_t >
	Dikjstra (const graph_t &G)

Protected Attributes inherited from Dikjstra< graph_t, policy_t >
std::vector< std::pair< node_t, edge_iter_t > >	previous

node_t	current

node_t	root

const graph_t &	G

Member Typedef Documentation

◆ node_t

typedef graph_t::node_t node_t

minimize_color_alteration_and_length ( const graph_t & G )

friend

The documentation for this class was generated from the following file: