GraphOrdering.cpp File Reference

Go to the source code of this file.

Functions
edgei	count_ordered_edges (const StaticGraph &g, int dir)
void	get_bfs_order (const StaticGraph &graph, std::vector< verti > &perm)
void	get_dfs_order (const StaticGraph &graph, std::vector< verti > &perm)

Function Documentation

count_ordered_edges()

edgei count_ordered_edges	(	const StaticGraph &	g,
		int	dir
	)

Count the number of edges with a specific ordering of vertices. An edge (i,j) is counted if sign(j - i) == sign(dir).

Definition at line 15 of file GraphOrdering.cpp.

get_bfs_order()

void get_bfs_order	(	const StaticGraph &	graph,
		std::vector< verti > &	perm
	)

Traverses the graph in breadth-first search order, and returns the result in perm, such that perm[v] = i if v is the i-th visited vertex.

Definition at line 30 of file GraphOrdering.cpp.

get_dfs_order()

void get_dfs_order	(	const StaticGraph &	graph,
		std::vector< verti > &	perm
	)

Traverses the graph in depth-first search order, and returns the result in perm, such that perm[v] = i if v is the i-th visited vertex.

Definition at line 60 of file GraphOrdering.cpp.