#include <graph.h>

Inheritance diagram for util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >:

Classes
class	OutgoingArcIterator

Public Member Functions
	CompleteBipartiteGraph (NodeIndexType left_nodes, NodeIndexType right_nodes)

NodeIndexType	Head (ArcIndexType arc) const

NodeIndexType	Tail (ArcIndexType arc) const

ArcIndexType	OutDegree (NodeIndexType node) const

IntegerRange< ArcIndexType >	OutgoingArcs (NodeIndexType node) const

IntegerRange< ArcIndexType >	OutgoingArcsStartingFrom (NodeIndexType node, ArcIndexType from) const

IntegerRange< NodeIndexType >	operator[] (NodeIndexType node) const

Public Member Functions inherited from util::BaseGraph< int32_t, int32_t, false >
	BaseGraph ()

	BaseGraph (const BaseGraph &)=default

BaseGraph &	operator= (const BaseGraph &)=default

virtual	~BaseGraph ()=default

int32_t	num_nodes () const

int32_t	size () const

int32_t	num_arcs () const
	Returns the number of valid arcs in the graph.

IntegerRange< NodeIndex >	AllNodes () const
	BaseGraph implementation -------------------------------------------------—.

IntegerRange< ArcIndex >	AllForwardArcs () const

bool	IsNodeValid (int32_t node) const
	Returns true if the given node is a valid node of the graph.

bool	IsArcValid (int32_t arc) const

int32_t	node_capacity () const
	Capacity reserved for future nodes, always >= num_nodes_.

int32_t	arc_capacity () const
	Capacity reserved for future arcs, always >= num_arcs_.

virtual void	ReserveNodes (int32_t bound)

virtual void	ReserveArcs (int32_t bound)

void	Reserve (int32_t node_capacity, int32_t arc_capacity)

void	FreezeCapacities ()

void	GroupForwardArcsByFunctor (const A &a, B *b)

int32_t	max_end_arc_index () const

Additional Inherited Members
Public Types inherited from util::BaseGraph< int32_t, int32_t, false >
typedef int32_t	NodeIndex

typedef int32_t	ArcIndex

Static Public Attributes inherited from util::BaseGraph< int32_t, int32_t, false >
static const int32_t	kNilNode

static const int32_t	kNilArc

Protected Member Functions inherited from util::BaseGraph< int32_t, int32_t, false >
void	ComputeCumulativeSum (std::vector< int32_t > *v)
	Functions commented when defined because they are implementation details.

void	BuildStartAndForwardHead (SVector< int32_t > head, std::vector< int32_t > start, std::vector< int32_t > *permutation)

Protected Attributes inherited from util::BaseGraph< int32_t, int32_t, false >
int32_t	num_nodes_

int32_t	node_capacity_

int32_t	num_arcs_

int32_t	arc_capacity_

bool	const_capacities_

Detailed Description

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>
class util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >

CompleteBipartiteGraph implementation ------------------------------------— Nodes and arcs are implicit and not stored.

Definition at line 2300 of file graph.h.

Constructor & Destructor Documentation

◆ CompleteBipartiteGraph()

template<typename NodeIndexType = int32_t, typename ArcIndexType = int32_t>

util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::CompleteBipartiteGraph	(	NodeIndexType	left_nodes,
		NodeIndexType	right_nodes )

inline

Builds a complete bipartite graph from a set of left nodes to a set of right nodes. Indices of left nodes of the bipartite graph range from 0 to left_nodes-1; indices of right nodes range from left_nodes to left_nodes+right_nodes-1.

Definition at line 2314 of file graph.h.