Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
GraphFeatures.hpp
Go to the documentation of this file.
1
6// Copyright (c) 2017 Czech Technical University in Prague | Faculty of Information Technology. All rights reserved.
7
8#pragma once
9
11
12namespace graph {
13
14class GraphBase;
15
16template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
17class GraphInterface;
18
19template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
20class UndirectedGraph;
21
22template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
23class UndirectedMultiGraph;
24
25template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
26class DirectedGraph;
27
28template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
29class DirectedMultiGraph;
30
31template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
32class MixedGraph;
33
34template<typename TNode = DefaultNodeType, typename = DefaultEdgeType>
35class MixedMultiGraph;
36
37} // namespace graph
38
graph::UndirectedGraph< node::Node, edge::CapacityEdge< node::Node, int > > UndirectedGraph
Definition: FordFulkerson.hpp:26
graph::DirectedGraph< node::Node, edge::CapacityEdge< node::Node, int > > DirectedGraph
Definition: FordFulkerson.hpp:27
Definition: ReconstructPath.hpp:14