r1078:c59bdcc8e33e
Fri, 05 Aug 2011 00:17:29
[Not Reviewed]
0 comments (0 inline)
0
24
0
2
2
1
1
1
1
1
1
4
4
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -73,3 +73,3 @@ |
| 73 | 73 |
|
| 74 |
This directory contains some auxiliary classes for implementing graphs, |
|
| 74 |
This directory contains some auxiliary classes for implementing graphs, |
|
| 75 | 75 |
maps and some other classes. |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -305,3 +305,3 @@ |
| 305 | 305 |
\brief Skeleton and concept checking classes for maps |
| 306 |
|
|
| 306 |
|
|
| 307 | 307 |
This group describes the skeletons and concept checking classes of maps. |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -98,3 +98,3 @@ |
| 98 | 98 |
char buf1[11], buf2[9], buf3[5]; |
| 99 |
|
|
| 99 |
if (GetDateFormat(MY_LOCALE, 0, &time, |
|
| 100 | 100 |
("ddd MMM dd"), buf1, 11) &&
|
| ... | ... |
@@ -393,3 +393,3 @@ |
| 393 | 393 |
template <typename Digraph> |
| 394 |
DigraphReader<Digraph> digraphReader(Digraph& digraph, |
|
| 394 |
DigraphReader<Digraph> digraphReader(Digraph& digraph, |
|
| 395 | 395 |
std::istream& is = std::cin); |
| ... | ... |
@@ -565,3 +565,3 @@ |
| 565 | 565 |
template <typename DGR> |
| 566 |
friend DigraphReader<DGR> digraphReader(DGR& digraph, |
|
| 566 |
friend DigraphReader<DGR> digraphReader(DGR& digraph, |
|
| 567 | 567 |
const std::string& fn); |
| ... | ... |
@@ -1231,5 +1231,5 @@ |
| 1231 | 1231 |
class GraphReader; |
| 1232 |
|
|
| 1232 |
|
|
| 1233 | 1233 |
template <typename Graph> |
| 1234 |
GraphReader<Graph> graphReader(Graph& graph, |
|
| 1234 |
GraphReader<Graph> graphReader(Graph& graph, |
|
| 1235 | 1235 |
std::istream& is = std::cin); |
| ... | ... |
@@ -1368,3 +1368,3 @@ |
| 1368 | 1368 |
template <typename GR> |
| 1369 |
friend GraphReader<GR> graphReader(GR& graph, const std::string& fn); |
|
| 1369 |
friend GraphReader<GR> graphReader(GR& graph, const std::string& fn); |
|
| 1370 | 1370 |
template <typename GR> |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -508,3 +508,3 @@ |
| 508 | 508 |
template <typename DGR> |
| 509 |
friend DigraphWriter<DGR> digraphWriter(const DGR& digraph, |
|
| 509 |
friend DigraphWriter<DGR> digraphWriter(const DGR& digraph, |
|
| 510 | 510 |
std::ostream& os); |
| ... | ... |
@@ -1084,3 +1084,3 @@ |
| 1084 | 1084 |
const char *fn); |
| 1085 |
|
|
| 1085 |
|
|
| 1086 | 1086 |
GraphWriter(GraphWriter& other) |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -842,4 +842,4 @@ |
| 842 | 842 |
public: |
| 843 |
operator Edge() const {
|
|
| 844 |
return id != -1 ? edgeFromId(id / 2) : INVALID; |
|
| 843 |
operator Edge() const {
|
|
| 844 |
return id != -1 ? edgeFromId(id / 2) : INVALID; |
|
| 845 | 845 |
} |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -968,3 +968,3 @@ |
| 968 | 968 |
|
| 969 |
|
|
| 969 |
|
|
| 970 | 970 |
template <typename From, typename To, |
| ... | ... |
@@ -974,3 +974,3 @@ |
| 974 | 974 |
PathCopySelectorForward<From, To>::copy(from, to); |
| 975 |
} |
|
| 975 |
} |
|
| 976 | 976 |
}; |
| ... | ... |
@@ -981,3 +981,3 @@ |
| 981 | 981 |
PathCopySelectorBackward<From, To>::copy(from, to); |
| 982 |
} |
|
| 982 |
} |
|
| 983 | 983 |
}; |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -468,4 +468,4 @@ |
| 468 | 468 |
public: |
| 469 |
operator Edge() const {
|
|
| 470 |
return _id != -1 ? edgeFromId(_id / 2) : INVALID; |
|
| 469 |
operator Edge() const {
|
|
| 470 |
return _id != -1 ? edgeFromId(_id / 2) : INVALID; |
|
| 471 | 471 |
} |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -1191,3 +1191,3 @@ |
| 1191 | 1191 |
pushRight(jd, ld); |
| 1192 |
if (less(ld, nodes[jd].left) || |
|
| 1192 |
if (less(ld, nodes[jd].left) || |
|
| 1193 | 1193 |
nodes[ld].item == nodes[pd].item) {
|
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -72,3 +72,3 @@ |
| 72 | 72 |
node(fn, tn).arc(fa, ta).run(); |
| 73 |
|
|
| 73 |
|
|
| 74 | 74 |
check(countNodes(from) == countNodes(to), "Wrong copy."); |
| ... | ... |
@@ -100,3 +100,3 @@ |
| 100 | 100 |
digraphCopy(from, to).run(); |
| 101 |
|
|
| 101 |
|
|
| 102 | 102 |
check(countNodes(from) == countNodes(to), "Wrong copy."); |
| ... | ... |
@@ -202,3 +202,3 @@ |
| 202 | 202 |
graphCopy(from, to).run(); |
| 203 |
|
|
| 203 |
|
|
| 204 | 204 |
check(countNodes(from) == countNodes(to), "Wrong copy."); |
| ... | ... |
@@ -65,6 +65,6 @@ |
| 65 | 65 |
|
| 66 |
int main() |
|
| 66 |
int main() |
|
| 67 | 67 |
{
|
| 68 | 68 |
{
|
| 69 |
ListDigraph d; |
|
| 69 |
ListDigraph d; |
|
| 70 | 70 |
ListDigraph::Node s,t; |
| ... | ... |
@@ -95,3 +95,3 @@ |
| 95 | 95 |
{
|
| 96 |
ListDigraph d; |
|
| 96 |
ListDigraph d; |
|
| 97 | 97 |
std::istringstream input(test_lgf_nomap); |
| ... | ... |
@@ -112,3 +112,3 @@ |
| 112 | 112 |
{
|
| 113 |
ListDigraph d; |
|
| 113 |
ListDigraph d; |
|
| 114 | 114 |
std::istringstream input(test_lgf_bad1); |
| ... | ... |
@@ -119,3 +119,3 @@ |
| 119 | 119 |
} |
| 120 |
catch (FormatError& error) |
|
| 120 |
catch (FormatError& error) |
|
| 121 | 121 |
{
|
| ... | ... |
@@ -141,3 +141,3 @@ |
| 141 | 141 |
{
|
| 142 |
ListDigraph d; |
|
| 142 |
ListDigraph d; |
|
| 143 | 143 |
std::istringstream input(test_lgf_bad2); |
| ... | ... |
@@ -4,3 +4,3 @@ |
| 4 | 4 |
* |
| 5 |
* Copyright (C) 2003- |
|
| 5 |
* Copyright (C) 2003-2011 |
|
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| ... | ... |
@@ -71,4 +71,6 @@ |
| 71 | 71 |
checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >(); |
| 72 |
checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >(); |
|
| 73 |
checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >(); |
|
| 72 |
checkConcept<ReferenceMap<A,B,B&,const B&>, |
|
| 73 |
ReferenceMap<A,B,B&,const B&> >(); |
|
| 74 |
checkConcept<ReferenceMap<A,C,C&,const C&>, |
|
| 75 |
ReferenceMap<A,C,C&,const C&> >(); |
|
| 74 | 76 |
|
| ... | ... |
@@ -201,3 +203,4 @@ |
| 201 | 203 |
checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >(); |
| 202 |
MapToFunctor<ReadMap<A,B> > map = |
|
| 204 |
MapToFunctor<ReadMap<A,B> > map = |
|
| 205 |
MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>()); |
|
| 203 | 206 |
|
0 comments (0 inline)