Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

dimacs.h File Reference


Detailed Description

Definition in file dimacs.h.

#include <iostream>
#include <string>
#include <vector>
#include <lemon/maps.h>

Include dependency graph for dimacs.h:

Go to the source code of this file.

Namespaces

namespace  lemon

Functions

template<typename Graph, typename CapacityMap, typename CostMap>
void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s, typename Graph::Node &t, CostMap &cost)
 Dimacs min cost flow reader function.
template<typename Graph, typename CapacityMap>
void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s, typename Graph::Node &t)
 Dimacs max flow reader function.
template<typename Graph, typename CapacityMap>
void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s)
 Dimacs shortest path reader function.
template<typename Graph, typename CapacityMap>
void readDimacs (std::istream &is, Graph &g, CapacityMap &capacity)
 Dimacs capacitated graph reader function.
template<typename Graph>
void readDimacs (std::istream &is, Graph &g)
 Dimacs plain graph reader function.
template<typename Graph>
void writeDimacs (std::ostream &os, const Graph &g)
 write matching problem


Generated on Sat Mar 19 10:58:43 2005 for LEMON by  doxygen 1.4.1