Classes |
struct | absl::synchronization_internal::Edge |
class | absl::synchronization_internal::GraphCyclesTest |
Namespaces |
namespace | absl |
namespace | absl::synchronization_internal |
Typedefs |
typedef std::map< int, GraphId > | absl::synchronization_internal::IdMap |
Functions |
static void | absl::synchronization_internal::CheckEdges (Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc) |
static void | absl::synchronization_internal::CheckInvariants (const GraphCycles &gc) |
static void | absl::synchronization_internal::CheckTransitiveClosure (Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc) |
static int | absl::synchronization_internal::EdgeIndex (Edges *edges, int from, int to) |
static GraphId | absl::synchronization_internal::Get (const IdMap &id, int num) |
static bool | absl::synchronization_internal::IsReachable (Edges *edges, int from, int to, std::unordered_set< int > *seen) |
static void | absl::synchronization_internal::PrintEdges (Edges *edges) |
static void | absl::synchronization_internal::PrintGCEdges (Nodes *nodes, const IdMap &id, GraphCycles *gc) |
static void | absl::synchronization_internal::PrintGCTransitiveClosure (Nodes *nodes, const IdMap &id, GraphCycles *gc) |
static void | absl::synchronization_internal::PrintTransitiveClosure (Nodes *nodes, Edges *edges) |
static int | absl::synchronization_internal::RandomEdge (RandomEngine *rng, Edges *edges) |
static int | absl::synchronization_internal::RandomNode (RandomEngine *rng, Nodes *nodes) |
| absl::synchronization_internal::TEST (GraphCycles, RandomizedTest) |
| absl::synchronization_internal::TEST_F (GraphCyclesTest, NoCycle) |
| absl::synchronization_internal::TEST_F (GraphCyclesTest, SimpleCycle) |
| absl::synchronization_internal::TEST_F (GraphCyclesTest, IndirectCycle) |
| absl::synchronization_internal::TEST_F (GraphCyclesTest, LongPath) |
| absl::synchronization_internal::TEST_F (GraphCyclesTest, RemoveNode) |
| absl::synchronization_internal::TEST_F (GraphCyclesTest, ManyEdges) |