Changeset 1909:2d806130e700 in lemon-0.x for doc
- Timestamp:
- 01/26/06 16:42:13 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2484
- Location:
- doc
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/Makefile.am
r1671 r1909 20 20 namespaces.dox \ 21 21 quicktour.dox \ 22 u ndir_graphs.dox22 ugraphs.dox 23 23 24 24 html/index.html: -
doc/graph_io.dox
r1901 r1909 318 318 The specialization of writing is very similar to that of reading. 319 319 320 \section u ndirUndirected graphs321 322 In a file describing an undirected graph (u ndirgraph, for short) you find an323 \c u ndiredgeset section instead of the \c edgeset section. The first line of320 \section u Undirected graphs 321 322 In a file describing an undirected graph (ugraph, for short) you find an 323 \c uedgeset section instead of the \c edgeset section. The first line of 324 324 the section describes the names of the maps on the undirected egdes and all 325 325 next lines describe one undirected edge with the the incident nodes and the … … 331 331 332 332 \code 333 @u ndiredgeset333 @uedgeset 334 334 label capacity +flow -flow 335 335 32 2 1 4.3 2.0 0.0 … … 338 338 \endcode 339 339 340 The \c edges section is changed to \c u ndiredges section. This section340 The \c edges section is changed to \c uedges section. This section 341 341 describes labeled edges and undirected edges. The directed edge label 342 342 should start with a \c '+' or a \c '-' prefix to decide the direction … … 344 344 345 345 \code 346 @u ndiredges347 u ndiredge 1346 @uedges 347 uedge 1 348 348 +edge 5 349 349 -back 5 … … 353 353 \ref lemon::GraphWriter "GraphWriter" which 354 354 handle the undirected graphs. These classes are 355 the \ref lemon::U ndirGraphReader "UndirGraphReader"356 and \ref lemon::U ndirGraphWriter "UndirGraphWriter".357 358 The \ref lemon::U ndirGraphReader::readUndirEdgeMap() "readUndirEdgeMap()"355 the \ref lemon::UGraphReader "UGraphReader" 356 and \ref lemon::UGraphWriter "UGraphWriter". 357 358 The \ref lemon::UGraphReader::readUEdgeMap() "readUEdgeMap()" 359 359 function reads an undirected map and the 360 \ref lemon::U ndirGraphReader::readUndirEdge() "readUndirEdge()"360 \ref lemon::UGraphReader::readUEdge() "readUEdge()" 361 361 reads an undirected edge from the file, 362 362 363 363 \code 364 reader.readU ndirEdgeMap("capacity", capacityMap);364 reader.readUEdgeMap("capacity", capacityMap); 365 365 reader.readEdgeMap("flow", flowMap); 366 366 ... 367 reader.readU ndirEdge("undir_edge", undir_edge);367 reader.readUEdge("u_edge", u_edge); 368 368 reader.readEdge("edge", edge); 369 369 \endcode … … 440 440 441 441 \code 442 UndirListGraph network;443 UndirListGraph::UndirEdgeMap<double> capacity;444 ListEdgeSet< UndirListGraph> traffic(network);445 ListEdgeSet< UndirListGraph>::EdgeMap<double> request(network);442 ListUGraph network; 443 ListUGraph::UEdgeMap<double> capacity; 444 ListEdgeSet<ListUGraph> traffic(network); 445 ListEdgeSet<ListUGraph>::EdgeMap<double> request(network); 446 446 447 447 LemonReader reader(std::cin); 448 NodeSetReader< UndirListGraph> nodesetReader(reader, network);449 U ndirEdgeSetReader<UndirListGraph>450 u ndirEdgesetReader(reader, network, nodesetReader);451 u ndirEdgesetReader.readEdgeMap("capacity", capacity);452 EdgeSetReader<ListEdgeSet< UndirListGraph> >448 NodeSetReader<ListUGraph> nodesetReader(reader, network); 449 UEdgeSetReader<ListUGraph> 450 uEdgesetReader(reader, network, nodesetReader); 451 uEdgesetReader.readEdgeMap("capacity", capacity); 452 EdgeSetReader<ListEdgeSet<ListUGraph> > 453 453 edgesetReader(reader, traffic, nodesetReader, "traffic"); 454 454 edgesetReader.readEdgeMap("request", request); … … 458 458 459 459 Because both the \ref lemon::GraphReader "GraphReader" 460 and the \ref lemon::U ndirGraphReader "UndirGraphReader" can be converted460 and the \ref lemon::UGraphReader "UGraphReader" can be converted 461 461 to \ref lemon::LemonReader "LemonReader" 462 462 and it can resolve the label's of the items, the previous 463 result can be achived with the \ref lemon::U ndirGraphReader "UndirGraphReader"463 result can be achived with the \ref lemon::UGraphReader "UGraphReader" 464 464 class, too. 465 465 466 466 467 467 \code 468 UndirListGraph network;469 UndirListGraph::UndirEdgeSet<double> capacity;470 ListEdgeSet< UndirListGraph> traffic(network);471 ListEdgeSet< UndirListGraph>::EdgeMap<double> request(network);472 473 U ndirGraphReader<UndirListGraph> reader(std::cin, network);468 ListUGraph network; 469 ListUGraph::UEdgeSet<double> capacity; 470 ListEdgeSet<ListUGraph> traffic(network); 471 ListEdgeSet<ListUGraph>::EdgeMap<double> request(network); 472 473 UGraphReader<ListUGraph> reader(std::cin, network); 474 474 reader.readEdgeMap("capacity", capacity); 475 EdgeSetReader<ListEdgeSet< UndirListGraph> >475 EdgeSetReader<ListEdgeSet<ListUGraph> > 476 476 edgesetReader(reader, traffic, reader, "traffic"); 477 477 edgesetReader.readEdgeMap("request", request); -
doc/undir_graphs.dox
r1030 r1909 1 1 /*! 2 2 3 \page u ndir_graphs Undirected graph structures3 \page ugraphs Undirected graph structures 4 4 5 5 The primary data structures of LEMON are the graph classes.
Note: See TracChangeset
for help on using the changeset viewer.