tu::bipartite_graph_bfs_node Struct Reference

#include <bipartite_graph_bfs.hpp>

Public Member Functions
bool	is_reachable () const

Public Attributes
int	distance
	Combinatorial distance to the search root or -1 if not reachable. More...
size_t	predecessor
	Index of the predecessor in the search tree. More...

Detailed Description

A node for a breadth first search on bipartite graphs.

Member Function Documentation

is_reachable()

bool tu::bipartite_graph_bfs_node::is_reachable ( ) const

inline

Returns

true if and only if this node is reachable

Member Data Documentation

distance

int tu::bipartite_graph_bfs_node::distance

Combinatorial distance to the search root or -1 if not reachable.

predecessor

size_t tu::bipartite_graph_bfs_node::predecessor

Index of the predecessor in the search tree.

---

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

• /home/runner/work/cmr/cmr/src/cmr/bipartite_graph_bfs.hpp