Files | |
file | dimacs.h |
Dimacs file format reader. | |
file | time_measure.h |
Tools for measuring cpu usage. | |
file | xy.h |
A simple two dimensional vector and a bounding box implementation. | |
file | test_tools.h |
Some utility to write test programs. | |
Classes | |
class | TimeStamp |
A class to store (cpu)time instances. More... | |
class | Timer |
Class measuring the cpu time and real time usage of the process. More... | |
class | xy |
A two dimensional vector (plainvector) implementation. More... | |
class | BoundingBox |
A class to calculate or store the bounding box of plainvectors. More... | |
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 | |
std::istream & | lemon::xy::operator>> (std::istream &is, xy< T > &z) |
Read a plainvector from a stream. | |
std::ostream & | lemon::xy::operator<< (std::ostream &os, xy< T > z) |
Write a plainvector to a stream. |
|
This function reads a min cost flow instance from dimacs format, i.e. from dimacs files having a line starting with
|
|
This function reads a max flow instance from dimacs format, i.e. from dimacs files having a line starting with
References lemon::readDimacs(). Here is the call graph for this function: ![]() |
|
This function reads a shortest path instance from dimacs format, i.e. from dimacs files having a line starting with
References lemon::readDimacs(). Here is the call graph for this function: ![]() |
|
This function reads an edge capacitated graph instance from dimacs format. At the beginning
References lemon::readDimacs(). Here is the call graph for this function: ![]() |
|
This function reads a graph without any designated nodes and maps from dimacs format, i.e. from dimacs files having a line starting with
References lemon::readDimacs(). Here is the call graph for this function: ![]() |