|
dune-istl 2.8.0
|
Loading...
Searching...
No Matches
dependency.hh
Go to the documentation of this file.
226 };
284 struct PropertyMapTypeSelector<Amg::VertexVisitedTag,Amg::PropertiesGraph<G,Amg::VertexProperties,EP,VM,EM> >
290 typename PropertyMapTypeSelector<Amg::VertexVisitedTag,Amg::PropertiesGraph<G,Amg::VertexProperties,EP,VM,EM> >::Type
291 get([[maybe_unused]] const Amg::VertexVisitedTag& tag, Amg::PropertiesGraph<G,Amg::VertexProperties,EP,VM,EM>& graph)
372 return ((flags_) & std::bitset<SIZE>((1<<INFLUENCE)|(1<<DEPEND)))==((1<<INFLUENCE)|(1<<DEPEND));
Provides classes for building the matrix graph.
Provides classes for handling internal properties in a graph.
bool depends() const
Checks wether the vertex the edge points to depends on the vertex the edge starts.
Definition dependency.hh:350
void resetFront()
Resets the front node flag.
Definition dependency.hh:443
std::bitset< VertexProperties::SIZE > BitSet
The type of the bitset.
Definition dependency.hh:236
bool isolated() const
Checks wether the node is isolated.
Definition dependency.hh:408
bool ValueType
The value type.
Definition dependency.hh:246
friend std::ostream & operator<<(std::ostream &os, const VertexProperties &props)
Definition dependency.hh:382
BitSet::reference Reference
The reference type.
Definition dependency.hh:241
bool isTwoWay() const
Checks wether the edge is two way. I.e. both the influence flag and the depends flag are that.
Definition dependency.hh:369
void setInfluences()
Marks the edge as one of which the start vertex by the end vertex.
Definition dependency.hh:323
VertexProperties()
Constructor.
Definition dependency.hh:387
void setDepends()
Marks the edge as one of which the end point depends on the starting point.
Definition dependency.hh:336
PropertyGraphVertexPropertyMap()
Default constructor.
Definition dependency.hh:264
PropertyGraphVertexPropertyMap(G &g)
Constructor.
Definition dependency.hh:257
G::VertexDescriptor Vertex
The vertex descriptor.
Definition dependency.hh:251
void resetExcludedBorder()
Marks the vertex as included in the aggregation.
Definition dependency.hh:458
void setFront()
Marks the node as belonging to the current clusters front.
Definition dependency.hh:433
void setVisited()
Mark the node as already visited.
Definition dependency.hh:418
void resetInfluences()
Resets the influence flag.
Definition dependency.hh:356
G Graph
The type of the graph with internal properties.
Definition dependency.hh:231
std::bitset< SIZE >::reference operator[](std::size_t v)
Access the bits directly.
Definition dependency.hh:393
void printFlags() const
Prints the attributes of the edge for debugging.
friend std::ostream & operator<<(std::ostream &os, const EdgeProperties &props)
Definition dependency.hh:298
Amg::PropertyGraphVertexPropertyMap< Amg::PropertiesGraph< G, Amg::VertexProperties, EP, VM, EM >, Amg::VertexProperties::VISITED > Type
Definition dependency.hh:286
bool influences() const
Checks wether the start vertex is influenced by the end vertex.
Definition dependency.hh:330
void setIsolated()
Marks that node as being isolated.
Definition dependency.hh:403
bool excludedBorder() const
Tests whether the vertex is excluded from the aggregation.
Definition dependency.hh:453
void resetVisited()
Resets the visited flag.
Definition dependency.hh:428
bool visited() const
Checks wether the node is marked as visited.
Definition dependency.hh:423
Reference operator[](const Vertex &vertex) const
Get the properties associated to a vertex.
Definition dependency.hh:273
void resetDepends()
Resets the depends flag.
Definition dependency.hh:343
ReadWritePropertyMapTag Category
Definition dependency.hh:221
void resetIsolated()
Resets the isolated flag.
Definition dependency.hh:413
std::ostream & operator<<(std::ostream &os, const AggregationCriterion< T > &criterion)
Definition aggregates.hh:111
bool isStrong() const
Checks wether the edge is strong. I.e. the influence or depends flag is set.
Definition dependency.hh:375
bool front() const
Checks wether the node is marked as a front node.
Definition dependency.hh:438
std::bitset< SIZE >::reference operator[](std::size_t v)
Access the bits directly.
Definition dependency.hh:308
void setExcludedBorder()
Marks the vertex as excluded from the aggregation.
Definition dependency.hh:448
bool isOneWay() const
Checks wether the edge is one way. I.e. either the influence or the depends flag but is set.
Definition dependency.hh:362
@ index
the index to access in the bitset.
Definition dependency.hh:225
Reference get(const RAPropertyMapHelper< Reference, PropertyMap > &pmap, const Key &key)
Class representing the properties of an ede in the matrix graph.
Definition dependency.hh:37
Class representing a node in the matrix graph.
Definition dependency.hh:124
Definition dependency.hh:218
Attaches properties to the edges and vertices of a graph.
Definition graph.hh:976
Tag idnetifying the visited property of a vertex.
Definition properties.hh:27
T reset(T... args)
T set(T... args)
T test(T... args)
T to_ulong(T... args)
Legal Statements / Impressum | Hosted by TU Dresden & Uni Heidelberg | Generated by
1.9.8