diff --git a/doc/adjacency_list.html b/doc/adjacency_list.html index 10cc75f1..9e55403a 100644 --- a/doc/adjacency_list.html +++ b/doc/adjacency_list.html @@ -1,7 +1,7 @@ - - - + + + Boost Graph Library: Edge Coloring - -C++ Boost + +C++ Boost
@@ -46,7 +46,7 @@

Computes an edge coloring for the vertices in the graph, using -an algorithm proposed by Mista et al. []. Given edges ordered +an algorithm proposed by Misra et al. []. Given edges ordered e1, e2, ..., en it assignes a colors c1, c2, ..., cn in a way that no vertex connects with 2 edges of the same color. Furthermore @@ -95,4 +95,4 @@ Maciej Piechotka (uzytkownik2@gmail.com - + diff --git a/doc/subgraph.html b/doc/subgraph.html index 90c6019c..c624c410 100644 --- a/doc/subgraph.html +++ b/doc/subgraph.html @@ -1,17 +1,17 @@ Boost Graph Library: Subgraph - -C++ Boost + +C++ Boost
@@ -187,7 +187,7 @@ the underlying Graph type. 

 graph_traits<subgraph>::vertex_descriptor
- The type for the vertex descriptors. + The type for the vertex descriptors. (Required by Graph.)
@@ -195,7 +195,7 @@ graph_traits<subgraph>::vertex_descriptor 
 graph_traits<subgraph>::edge_descriptor
- The type for the edge descriptors. + The type for the edge descriptors. (Required by Graph.)
@@ -203,7 +203,7 @@ graph_traits<subgraph>::edge_descriptor 
 graph_traits<subgraph>::vertex_iterator
- The type for the iterators returned by vertices. + The type for the iterators returned by vertices. (Required by VertexListGraph.)
@@ -211,14 +211,14 @@ graph_traits<subgraph>::vertex_iterator 
 graph_traits<subgraph>::edge_iterator
- The type for the iterators returned by edges. + The type for the iterators returned by edges. (Required by EdgeListGraph.) 
 graph_traits<subgraph>::out_edge_iterator
- The type for the iterators returned by out_edges. + The type for the iterators returned by out_edges. (Required by IncidenceGraph.)
@@ -226,14 +226,14 @@ graph_traits<subgraph>::out_edge_iterator graph_traits<subgraph>::in_edge_iterator The in_edge_iterator is the - iterator type returned by the in_edges function. + iterator type returned by the in_edges function. (Required by BidirectionalGraph.) 
 graph_traits<subgraph>::adjacency_iterator
- The type for the iterators returned by adjacent_vertices. + The type for the iterators returned by adjacent_vertices. (Required by AdjacencyGraph.)
@@ -252,7 +252,7 @@ graph_traits<subgraph>::edge_parallel_category parallel edges (edges with the same source and target), which depends on the underlying Graph class. The two tags are allow_parallel_edge_tag and - disallow_parallel_edge_tag. + disallow_parallel_edge_tag. (Required by Graph.)
@@ -388,7 +388,7 @@ subgraph& parent() 
 std::pair<children_iterator, children_iterator> children() const
-Return an iterator pair for accessing the children subgraphs. +Return an iterator pair for accessing the children subgraphs. @@ -441,7 +441,7 @@ out_edges(vertex_descriptor u_local, const subgraph& g) Returns an iterator range providing access to the out-edges of vertex u in subgraph g. If the graph is undirected, this iterator range provides access to all edge incident on - vertex u. + vertex u. (Required by IncidenceGraph.)
@@ -451,7 +451,7 @@ in_edges(vertex_descriptor v_local, const subgraph& g) Returns an iterator range providing access to the in-edges of vertex - v in subgraph g. + v in subgraph g. (Required by BidirectionalGraph.)
@@ -482,7 +482,7 @@ out_degree(vertex_descriptor u_local, const subgraph& g) 
 degree_size_type in_degree(vertex_descriptor u_local, const subgraph& g)
- Returns the number of edges entering vertex u in subgraph g. + Returns the number of edges entering vertex u in subgraph g. (Required by BidirectionalGraph.)
@@ -543,7 +543,7 @@ void remove_edge(vertex_descriptor u_local, vertex_descriptor v_local, subgraph& g) Removes the edge (u,v) from the subgraph and from all of the - ancestors of g in the subgraph tree. + ancestors of g in the subgraph tree. (Required by EdgeMutableGraph.)
@@ -551,7 +551,7 @@ void remove_edge(vertex_descriptor u_local, vertex_descriptor v_local, void remove_edge(edge_descriptor e_local, subgraph& g) Removes the edge e from the subgraph and from all of the - ancestors of g in the subgraph tree. + ancestors of g in the subgraph tree. (Required by EdgeMutableGraph.)
@@ -591,7 +591,7 @@ get(PropertyTag, const subgraph& g) descriptor for one subgraph will change the property for the global vertex descriptor, and therefore for all other subgraphs. However, the key type for a subgraph's property map is a subgraph-local - vertex or edge descriptor. + vertex or edge descriptor. (Required by PropertyGraph.)
@@ -605,7 +605,7 @@ get(PropertyTag, const subgraph& g, Key k_local) This returns the property value for the key k_local, which is either a local vertex or local edge descriptor. See the above get function - for more information about the propert maps. + for more information about the propert maps. (Required by PropertyGraph.)