|
Template Numerical Library version\ main:4e6e2c1
|
Type tag for directed graphs. More...
#include <TNL/Graphs/GraphOrientation.h>
Additional Inherited Members | |
| Static Public Member Functions inherited from TNL::Graphs::GraphOrientation< true > | |
| static std::string | getSerializationType () |
| Returns a string representation of the graph type for serialization. | |
| static constexpr bool | isDirected () |
| Checks if the graph is directed. | |
Type tag for directed graphs.
A directed graph (digraph) is a graph where edges have a direction. An edge from vertex u to vertex v can only be traversed from u to v, not from v to u (unless there is a separate edge in the opposite direction).