graph.h File Reference

#include <GTL/GTL.h>
#include <GTL/node.h>
#include <GTL/edge.h>
#include <GTL/edge_map.h>
#include <GTL/node_map.h>
#include <GTL/gml_parser.h>
#include <iostream>
#include <string>

Include dependency graph for graph.h:

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

Go to the source code of this file.

Classes
class	graph
	A directed or undirected graph. More...

Macros
#define	forall_nodes(v, g)   GTL_FORALL(v,g,graph::node_iterator,nodes_)
#define	forall_edges(v, g)   GTL_FORALL(v,g,graph::edge_iterator,edges_)

Macro Definition Documentation

#define forall_edges	(		v,
			g
	)		GTL_FORALL(v,g,graph::edge_iterator,edges_)

Definition at line 812 of file graph.h.

View newest version in sPHENIX GitHub at line 812 of file graph.h

Referenced by graph::insert_reverse_edges(), and graph::is_bidirected().

#define forall_nodes	(		v,
			g
	)		GTL_FORALL(v,g,graph::node_iterator,nodes_)

Definition at line 811 of file graph.h.

View newest version in sPHENIX GitHub at line 811 of file graph.h

Referenced by planarity::add_to_embedding(), graph::center(), planar_embedding::check(), planarity::examine_obstruction(), operator<<(), planar_embedding::operator=(), planar_embedding::planar_embedding(), bfs::run(), dfs::run(), and planarity::run_on_biconnected().