sort_rcm.cpp File Reference

#include "sort_rcm.h"
#include <unordered_set>

Include dependency graph for sort_rcm.cpp:

Functions
uvec	peripheral (const std::vector< uvec > &A, const uvec &E)
	Find a pair of pseudo-peripheral vertices.
uvec	sort_rcm (const std::vector< uvec > &A, const uvec &E)
uvec	sort_rcm (const std::vector< suanpan::unordered_set< uword > > &adjacency)

Function Documentation

peripheral()

uvec peripheral	(	const std::vector< uvec > &	A,
		const uvec &	E
	)

Find a pair of pseudo-peripheral vertices.

See the Gibbs-Poole-Stockmeyer (GPS) algorithm.

https://doi.org/10.1007/978-3-031-25820-6

Parameters

A	adjacency list
E	vertex degree list

Returns

a list of vertices beginning with the pseudo-peripheral vertex

Here is the caller graph for this function: