Changeset - r83:3654324ec035
« 82:bce6c8
84:816101 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Improvements in groups.dox - Apply the graph renamings. - Apply the current map renamings.
0 1 0
default
1 file changed with 27 insertions and 29 deletions:
doc/groups.dox
27
29
↑ Collapse diff ↑
doc/groups.dox
Show white space 6 line context
... ... 
@@ -40,3 +40,3 @@
40 40 
running time or on memory usage, some structures may fail to provide
41 
some graph features like edge or node deletion.
41 
some graph features like arc/edge or node deletion.
42 42 

			




	...
	...
	
		
@@ -46,3 +46,3 @@


			




	46
	46
	
		
not alter the physical graph, but gives another view. If some nodes or 


			




	47
	
	
		
edges have to be hidden or the reverse oriented graph have to be used, then 


			




	
	47
	
		
arcs have to be hidden or the reverse oriented graph have to be used, then


			




	48
	48
	
		
this is the case. It also may happen that in a flow implementation 


			




	...
	...
	
		
@@ -83,6 +83,6 @@


			




	83
	83
	
		
@ingroup maps


			




	84
	
	
		
\brief Special Graph-Related Maps.


			




	
	84
	
		
\brief Special graph-related maps.


			




	85
	85
	
		

			




	86
	86
	
		
This group describes maps that are specifically designed to assign


			




	87
	
	
		
values to the nodes and edges of graphs.


			




	
	87
	
		
values to the nodes and arcs of graphs.


			




	88
	88
	
		
*/


			




	...
	...
	
		
@@ -98,6 +98,6 @@


			




	98
	98
	
		

			




	99
	
	
		
Most of them are \ref lemon::concepts::ReadMap "ReadMap"s. They can


			




	100
	
	
		
make arithmetic operations between one or two maps (negation, scaling,


			




	101
	
	
		
addition, multiplication etc.) or e.g. convert a map to another one


			




	102
	
	
		
of different Value type.


			




	
	99
	
		
Most of them are \ref lemon::concepts::ReadMap "read-only maps".


			




	
	100
	
		
They can make arithmetic and logical operations between one or two maps


			




	
	101
	
		
(negation, shifting, addition, multiplication, logical 'and', 'or',


			




	
	102
	
		
'not' etc.) or e.g. convert a map to another one of different Value type.


			




	103
	103
	
		

			




	...
	...
	
		
@@ -106,3 +106,3 @@


			




	106
	106
	
		
type map adaptors can be used comfortable. For example let's see the


			




	107
	
	
		
usage of map adaptors with the \c graphToEps() function:


			




	
	107
	
		
usage of map adaptors with the \c digraphToEps() function.


			




	108
	108
	
		
\code


			




	...
	...
	
		
@@ -118,13 +118,13 @@


			




	118
	118
	
		
  


			




	119
	
	
		
  Graph::NodeMap<int> degree_map(graph);


			




	
	119
	
		
  Digraph::NodeMap<int> degree_map(graph);


			




	120
	120
	
		
  


			




	121
	
	
		
  graphToEps(graph, "graph.eps")


			




	
	121
	
		
  digraphToEps(graph, "graph.eps")


			




	122
	122
	
		
    .coords(coords).scaleToA4().undirected()


			




	123
	
	
		
    .nodeColors(composeMap(functorMap(nodeColor), degree_map)) 


			




	
	123
	
		
    .nodeColors(composeMap(functorToMap(nodeColor), degree_map))


			




	124
	124
	
		
    .run();


			




	125
	125
	
		
\endcode 


			




	126
	
	
		
The \c functorMap() function makes an \c int to \c Color map from the


			




	
	126
	
		
The \c functorToMap() function makes an \c int to \c Color map from the


			




	127
	127
	
		
\e nodeColor() function. The \c composeMap() compose the \e degree_map


			




	128
	
	
		
and the previous created map. The composed map is proper function to


			




	129
	
	
		
get color of each node.


			




	
	128
	
		
and the previously created map. The composed map is a proper function to


			




	
	129
	
		
get the color of each node.


			




	130
	130
	
		

			




	...
	...
	
		
@@ -134,19 +134,17 @@


			




	134
	134
	
		
\code


			




	135
	
	
		
  Graph graph;


			




	136
	
	
		
  


			




	137
	
	
		
  typedef Graph::EdgeMap<double> DoubleEdgeMap;


			




	138
	
	
		
  DoubleEdgeMap length(graph);


			




	139
	
	
		
  DoubleEdgeMap speed(graph);


			




	140
	
	
		
  


			




	141
	
	
		
  typedef DivMap<DoubleEdgeMap, DoubleEdgeMap> TimeMap;


			




	142
	
	
		
  


			




	
	135
	
		
  Digraph graph;


			




	
	136
	
		

			




	
	137
	
		
  typedef Digraph::ArcMap<double> DoubleArcMap;


			




	
	138
	
		
  DoubleArcMap length(graph);


			




	
	139
	
		
  DoubleArcMap speed(graph);


			




	
	140
	
		

			




	
	141
	
		
  typedef DivMap<DoubleArcMap, DoubleArcMap> TimeMap;


			




	143
	142
	
		
  TimeMap time(length, speed);


			




	144
	143
	
		
  


			




	145
	
	
		
  Dijkstra<Graph, TimeMap> dijkstra(graph, time);


			




	
	144
	
		
  Dijkstra<Digraph, TimeMap> dijkstra(graph, time);


			




	146
	145
	
		
  dijkstra.run(source, target);


			




	147
	146
	
		
\endcode


			




	148
	
	
		

			




	149
	
	
		
We have a length map and a maximum speed map on a graph. The minimum


			




	150
	
	
		
time to pass the edge can be calculated as the division of the two


			




	151
	
	
		
maps which can be done implicitly with the \c DivMap template


			




	
	147
	
		
We have a length map and a maximum speed map on the arcs of a digraph.


			




	
	148
	
		
The minimum time to pass the arc can be calculated as the division of


			




	
	149
	
		
the two maps which can be done implicitly with the \c DivMap template


			




	152
	150
	
		
class. We use the implicit minimum time map as the length map of the


			




	...
	...
	
		
@@ -317,3 +315,3 @@


			




	317
	315
	
		
matchings in graphs and bipartite graphs. The general matching problem is


			




	318
	
	
		
finding a subset of the edges which does not shares common endpoints.


			




	
	316
	
		
finding a subset of the arcs which does not shares common endpoints.


			




	319
	317
	
		
 


			




        

    






    
    



    


    

     
    
0 comments (0 inline)