generate_spanning_tree_picture.H File Reference

Spanning tree visualization with highlighted tree/non-tree edges. More...

#include <generate_graph.H>

Include dependency graph for generate_spanning_tree_picture.H:

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

Go to the source code of this file.

Classes
struct	Shade_Span_Node< GT >
	Shading functor for spanning tree nodes. More...
struct	Shade_Span_Arc< GT >
	Shading functor for spanning tree arcs. More...

Functions
template<typename GT , class Write_Node , class Write_Arc , class SA >
void	generate_cross_spanning_tree (GT &g, const size_t &nodes_by_level, const double &xdist, const double &ydist, std::ofstream &output)
	Generate a cross-layout visualization of a spanning tree.
template<typename GT , class Write_Node , class Write_Arc >
void	generate_cross_spanning_tree (GT &g, const size_t &nodes_by_level, const double &xdist, const double &ydist, std::ofstream &output)
	Overload with default arc filter.
template<typename GT , class Write_Node , class Write_Arc , class SA >
void	generate_net_spanning_tree (GT &g, const size_t &nodes_by_level, const double &xdist, const double &ydist, std::ofstream &output)
	Generate a net-layout visualization of a spanning tree.
template<typename GT , class Write_Node , class Write_Arc >
void	generate_net_spanning_tree (GT &g, const size_t &nodes_by_level, const double &xdist, const double &ydist, std::ofstream &output)
	Overload with default arc filter.

Detailed Description

Spanning tree visualization with highlighted tree/non-tree edges.

This file provides utilities for generating visual representations of spanning trees where tree edges are distinguished from non-tree edges through shading/highlighting.

Key Features

• Visualize spanning trees with clear distinction between:
  • Tree edges (spanning tree arcs)
  • Non-tree edges (cross/back edges)
• Support for both cross-layout and net-layout visualizations
• Compatible with graphpic visualization tools

Shading Convention

The shading functors use the node/arc cookie field to determine if an element belongs to the spanning tree:

• Cookie == nullptr: Not in spanning tree (normal display)
• Cookie != nullptr: In spanning tree (shadowed/highlighted)

See also

generate_graph.H For underlying graph visualization

tpl_spanning_tree.H For spanning tree algorithms

Author

Leandro Rabindranath León

Definition in file generate_spanning_tree_picture.H.

Function Documentation

generate_cross_spanning_tree()

template<typename GT , class Write_Node , class Write_Arc >

void generate_cross_spanning_tree	(	GT &	g,
		const size_t &	nodes_by_level,
		const double &	xdist,
		const double &	ydist,
		std::ofstream &	output
	)

Overload with default arc filter.

See also

generate_cross_spanning_tree()

Definition at line 136 of file generate_spanning_tree_picture.H.

References Aleph::maps(), and output.

generate_net_spanning_tree()

template<typename GT , class Write_Node , class Write_Arc >

void generate_net_spanning_tree	(	GT &	g,
		const size_t &	nodes_by_level,
		const double &	xdist,
		const double &	ydist,
		std::ofstream &	output
	)

Overload with default arc filter.

See also

generate_net_spanning_tree()

Definition at line 182 of file generate_spanning_tree_picture.H.

References Aleph::maps(), and output.