#include <graph.hh>
|
std::shared_ptr< const RemainingNodes > | remaining_nodes () const |
|
const std::string & | message () const noexcept |
|
std::string | backtrace (const std::string &delim) const |
|
bool | empty () const |
|
const char * | what () const noexcept |
|
virtual | ~Exception () |
|
|
| NoGraphTopologicalOrderExistsError (const std::shared_ptr< const RemainingNodes > &) noexcept |
|
| ~NoGraphTopologicalOrderExistsError () |
|
|
| GraphError (const std::string &msg) noexcept |
|
| Exception (const std::string &message) noexcept |
|
| Exception (const Exception &) |
|
Thrown if no ordering is available for a DirectedGraph::topological_sort.
std::shared_ptr<const RemainingNodes> paludis::NoGraphTopologicalOrderExistsError::remaining_nodes |
( |
| ) |
const |
The nodes remaining in the graph.
The documentation for this class was generated from the following file:
- /mnt/home/bo/scm/paludis/paludis/paludis/util/graph.hh