mirror of
https://github.com/Kitware/CMake.git
synced 2025-07-21 23:40:38 +08:00
1d829c862c
Automate with: git grep -l '#include <cm_' -- Source \ | xargs sed -i 's/#include <\(cm_.*\)>/#include "\1"/g' git grep -l '#include <cmsys/' -- Source \ | xargs sed -i 's/#include <\(cmsys\/.*\)>/#include "\1"/g' git grep -l '#include <cm[A-Z]' -- Source \ | xargs sed -i 's/#include <\(cm[A-Z].*\)>/#include "\1"/g'
56 lines
1.1 KiB
C++
56 lines
1.1 KiB
C++
/* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
|
|
file Copyright.txt or https://cmake.org/licensing for details. */
|
|
#ifndef cmGraphAdjacencyList_h
|
|
#define cmGraphAdjacencyList_h
|
|
|
|
#include "cmConfigure.h" // IWYU pragma: keep
|
|
|
|
#include <vector>
|
|
|
|
/**
|
|
* Graph edge representation. Most use cases just need the
|
|
* destination vertex, so we support conversion to/from an int. We
|
|
* also store boolean to indicate whether an edge is "strong".
|
|
*/
|
|
class cmGraphEdge
|
|
{
|
|
public:
|
|
cmGraphEdge()
|
|
: Dest(0)
|
|
, Strong(true)
|
|
{
|
|
}
|
|
cmGraphEdge(int n)
|
|
: Dest(n)
|
|
, Strong(true)
|
|
{
|
|
}
|
|
cmGraphEdge(int n, bool s)
|
|
: Dest(n)
|
|
, Strong(s)
|
|
{
|
|
}
|
|
cmGraphEdge(cmGraphEdge const& r)
|
|
: Dest(r.Dest)
|
|
, Strong(r.Strong)
|
|
{
|
|
}
|
|
operator int() const { return this->Dest; }
|
|
|
|
bool IsStrong() const { return this->Strong; }
|
|
private:
|
|
int Dest;
|
|
bool Strong;
|
|
};
|
|
struct cmGraphEdgeList : public std::vector<cmGraphEdge>
|
|
{
|
|
};
|
|
struct cmGraphNodeList : public std::vector<int>
|
|
{
|
|
};
|
|
struct cmGraphAdjacencyList : public std::vector<cmGraphEdgeList>
|
|
{
|
|
};
|
|
|
|
#endif
|