|
std::pair< CrossingIterator, CrossingIterator > | regina::vertices (const Link &l) |
| Returns an iterator range containing all vertices of the underlying graph of the given knot or link. More...
|
|
std::pair< ArcIterator, ArcIterator > | regina::edges (const Link &l) |
| Returns an iterator range containing all edges of the underlying graph of the given triangulation. More...
|
|
size_t | regina::num_vertices (const Link &l) |
| Returns the number of vertices in the underlying graph of the given knot or link. More...
|
|
size_t | regina::num_edges (const Link &l) |
| Returns the number of edges in the graph of the given knot or link. More...
|
|
Crossing * | regina::source (const StrandRef &e, const Link &l) |
| Returns the source vertex of the given directed edge in the underlying graph of the given knot or link. More...
|
|
Crossing * | regina::target (const StrandRef &e, const Link &l) |
| Returns the target vertex of the given directed edge in the underlying graph of the given knot or link. More...
|
|
unsigned | regina::degree (Crossing *v, const Link &l) |
| Returns the total degree of the given vertex in the graph of the given knot or link. More...
|
|
unsigned | regina::in_degree (Crossing *v, const Link &l) |
| Returns the in-degree of the given vertex in the graph of the given knot or link. More...
|
|
unsigned | regina::out_degree (Crossing *v, const Link &l) |
| Returns the out-degree of the given vertex in the graph of the given knot or link. More...
|
|
std::pair< graph::AdjacentCrossingIterator, graph::AdjacentCrossingIterator > | regina::adjacent_vertices (Crossing *v, const Link &l) |
| Returns an iterator range containing both vertices adjacent to the given vertex of the underlying knot/link graph along outgoing directed edges. More...
|
|
std::pair< graph::IncidentArcIterator< false >, graph::IncidentArcIterator< false > > | regina::in_edges (Crossing *v, const Link &l) |
| Returns an iterator range containing both directed edges entering the given vertex of the underlying knot/link graph. More...
|
|
std::pair< graph::IncidentArcIterator< true >, graph::IncidentArcIterator< true > > | regina::out_edges (Crossing *v, const Link &l) |
| Returns an iterator range containing both directed edges exiting the given vertex of the underlying knot/link graph. More...
|
|
size_t | regina::get (graph::InherentLinkPropertyMap< boost::vertex_index_t >, Crossing *v) |
| Returns the index of the given vertex of the underlying graph of a knot or link. More...
|
|
graph::InherentLinkPropertyMap< boost::vertex_index_t > | regina::get (boost::vertex_index_t, const Link &) |
| Returns a Boost property map that can be used to query indices of vertices in the underlying graph of a knot or link. More...
|
|
size_t | regina::get (boost::vertex_index_t, const Link &, Crossing *v) |
| Returns the index of the given vertex of the underlying graph of a knot or link. More...
|
|
Provides an interface for using knots and links with the Boost Graph Library.