#include <iostream>
#include <string>
#include <vector>
#include <lemon/maps.h>
#include <lemon/invalid.h>
Go to the source code of this file.
Namespaces | |
namespace | lemon |
Functions | |
template<typename Graph, typename CapacityMap, typename CostMap> | |
void | lemon::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 | lemon::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 | lemon::readDimacs (std::istream &is, Graph &g, CapacityMap &capacity, typename Graph::Node &s) |
Dimacs shortest path reader function. | |
template<typename Graph, typename CapacityMap> | |
void | lemon::readDimacs (std::istream &is, Graph &g, CapacityMap &capacity) |
Dimacs capacitated graph reader function. | |
template<typename Graph> | |
void | lemon::readDimacs (std::istream &is, Graph &g) |
Dimacs plain graph reader function. | |
template<typename Graph> | |
void | lemon::writeDimacs (std::ostream &os, const Graph &g) |
write matching problem |