Simplified graph interface for common use cases. More...

#include <cassert>
#include <cstring>
#include <stdexcept>
#include <memory>
#include <string>

Include dependency graph for aleph-graph.H:

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

Classes
class	Aleph::Bit_Fields
	Bit fields for nodes and arcs used for marking visit state during processing. More...

struct	Aleph::Graph_Attr
	General attributes for nodes and arc of graphs. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Macros
#define	NODE_BITS(p) ((p)->attrs.control_bits)
	Get the control bits of a node.

#define	NODE_COUNTER(p) ((p)->attrs.counter)
	Get the counter of a node.

#define	NODE_COLOR(p) ((p)->attrs.counter)
	Synonymous of NODE_COUNTER.

#define	IS_NODE_VISITED(p, bit) (NODE_BITS(p).get_bit(bit))
	Determine whether the control bit is set or not to one.

#define	NODE_COOKIE(p) ((p)->attrs.cookie)
	Return the node `cookie`

#define	ARC_COUNTER(p) ((p)->attrs.counter)
	Return the `counter` of arc p.

#define	ARC_COLOR(p) ((p)->attrs.counter)
	Return the color of arc p.

#define	ARC_BITS(p) ((p)->attrs.control_bits)
	Return the control bits of arc p.

#define	IS_ARC_VISITED(p, bit) (ARC_BITS(p).get_bit(bit))
	Determine whether the `bit` field is or not set to one.

#define	ARC_COOKIE(p) ((p)->attrs.cookie)
	Return the arc `cookie`

Enumerations
enum	Aleph::Graph_Bits { Aleph::Depth_First , Aleph::Breadth_First , Aleph::Test_Cycle , Aleph::Find_Path , Aleph::Euler , Aleph::Maximum_Flow , Aleph::Spanning_Tree , Aleph::Build_Subtree , Aleph::Convert_Tree , Aleph::Cut , Aleph::Min , Aleph::Num_Bits_Graph }
	Bit numbers of nodes or arcs. More...

Detailed Description

Simplified graph interface for common use cases.

Provides AlephGraph, a simplified graph class that wraps the more complex List_Graph with easier-to-use methods and automatic memory management.

Definition in file aleph-graph.H.

Classes