10 #include <Information.hpp>
48 template <
class vvgraph,
bool do_checks = true>
50 #ifdef JUST_FOR_DOXYGEN
67 unsigned int check = 0;
75 Information::err <<
"Warning: Attempt to insert a vertex between vertices that have no relation." << endl;
79 Information::err <<
"Warning: Attempt to insert a vertex between vertices that have an assymetric relation."
100 template <
class vvgraph>
class Insert<
vvgraph, false> {
119 template <
typename VertexContent,
typename EdgeContent,
typename Alloc>
120 const typename graph::VVGraph<VertexContent, EdgeContent, Alloc>::vertex_t&
121 insert(
const typename graph::VVGraph<VertexContent, EdgeContent, Alloc>::vertex_t& a,
122 const typename graph::VVGraph<VertexContent, EdgeContent, Alloc>::vertex_t& b,
123 graph::VVGraph<VertexContent, EdgeContent, Alloc>&S)
125 typedef Insert<graph::VVGraph<VertexContent, EdgeContent, Alloc> > Insert;
126 static const Insert fct = Insert();
134 template <
class Graph>
135 typename Graph::edge_t insertAfter(
const typename Graph::vertex_t& v,
const typename Graph::vertex_t& ref,
136 const typename Graph::vertex_t& nv, Graph& S)
139 return S.spliceAfter(v, ref, nv);
140 return S.insertEdge(v, nv);
147 template <
class Graph>
148 typename Graph::edge_t insertBefore(
const typename Graph::vertex_t& v,
const typename Graph::vertex_t& ref,
149 const typename Graph::vertex_t& nv, Graph& S)
152 return S.spliceBefore(v, ref, nv);
153 return S.insertEdge(v, nv);
edge_t insertEdge(const vertex_t &src, const vertex_t &tgt)
Insert a new edge in the graph, without ordering.
Definition: VVGraph.hpp:2035
edge_t replace(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor)
Replace a vertex by another in a neighborhood.
Definition: VVGraph.hpp:1894
vvgraph::vertex_t vertex
Type of a vertex.
Definition: Mesh.hpp:39
Insert a new vertex on an edge.
Definition: Insert.hpp:49
Vertex of a vv graph.
Definition: Vertex.hpp:57
Define the STATIC_ASSERT macro.
Contain the definition of the VVGraph template class.
bool isNull() const
Test if a vertex is a null vertex.
Definition: Vertex.hpp:274
iterator insert(const vertex_t &v)
Insert a new vertex in the graph.
Definition: VVGraph.hpp:1585
edge_t edge(const vertex_t &src, const vertex_t &tgt)
Returns the edge from src to tgt.
Definition: VVGraph.hpp:1954