Aleph::Compute_Bipartite< GT, SA > Class Template Reference

Class that takes a bipartite graph and computes the partition sets. More...

#include <tpl_bipartite.H>

Public Member Functions
void	operator() (const GT &g, DynDlist< typename GT::Node * > &l, DynDlist< typename GT::Node * > &r)
	Computes the partition sets of a bipartite graph.

Detailed Description

template<class GT, class SA = Dft_Show_Arc<GT>>
class Aleph::Compute_Bipartite< GT, SA >

Class that takes a bipartite graph and computes the partition sets.

A graph is bipartite if it can be divided into two subsets l and r such that every node in l only has edges to nodes in r and vice versa.

Definition at line 164 of file tpl_bipartite.H.

Member Function Documentation

operator()()

template<class GT , class SA = Dft_Show_Arc<GT>>

void Aleph::Compute_Bipartite< GT, SA >::operator() ( const GT &  g, DynDlist< typename GT::Node * > &  l, DynDlist< typename GT::Node * > &  r  )

inline

Computes the partition sets of a bipartite graph.

Parameters

[in]	g	the bipartite graph.
[out]	l	one partition set.
[out]	r	the other partition set.

Exceptions

domain_error	if during computation it is determined that the graph is not bipartite.
bad_alloc	if there is not enough memory.

Definition at line 176 of file tpl_bipartite.H.

References l, and Aleph::maps().

---

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

• tpl_bipartite.H