[Lemon-commits] [lemon_svn] klao: r1272 - hugo/branches/graph_factory/src/lemon/skeletons
Lemon SVN
svn at lemon.cs.elte.hu
Mon Nov 6 20:44:18 CET 2006
Author: klao
Date: Wed Oct 6 16:28:20 2004
New Revision: 1272
Modified:
hugo/branches/graph_factory/src/lemon/skeletons/graph.h
Log:
Graph operations in GraphBase are void.
Modified: hugo/branches/graph_factory/src/lemon/skeletons/graph.h
==============================================================================
--- hugo/branches/graph_factory/src/lemon/skeletons/graph.h (original)
+++ hugo/branches/graph_factory/src/lemon/skeletons/graph.h Wed Oct 6 16:28:20 2004
@@ -566,27 +566,28 @@
class Edge : public BaseGraphItem {};
// Graph operation
- Node& first(Node &n) const { return n; }
- Edge& first(Edge &e) const { return e; }
+ void first(Node &n) const { return n; }
+ void first(Edge &e) const { return e; }
- Edge& firstOut(Edge &e, Node) const { return e; }
- Edge& firstIn(Edge &e, Node) const { return e; }
+ void firstOut(Edge &e, Node) const { return e; }
+ void firstIn(Edge &e, Node) const { return e; }
- Node& next(Node &n) const { return n; }
- Edge& next(Edge &e) const { return e; }
+ void next(Node &n) const { return n; }
+ void next(Edge &e) const { return e; }
// Question: isn't it reasonable if this methods have a Node
// parameter? Like this:
// Edge& nextOut(Edge &e, Node) const { return e; }
- Edge& nextOut(Edge &e) const { return e; }
- Edge& nextIn(Edge &e) const { return e; }
+ void nextOut(Edge &e) const { return e; }
+ void nextIn(Edge &e) const { return e; }
Node head(Edge) const { return Node(); }
Node tail(Edge) const { return Node(); }
- // ... Egyeb sallang, mint az id, nodeNum, edgeNum kell ide?
+ // Do we need id, nodeNum, edgeNum and co. in this basic graphbase
+ // concept?
// Maps.
More information about the Lemon-commits
mailing list