Warning, file /office/calligra/libs/main/KoFilterEdge.h was not indexed or was modified since last indexation (in which case cross-reference links may be missing, inaccurate or erroneous).

 /* This file is part of the Calligra libraries
    Copyright (C) 2001 Werner Trobin <trobin@kde.org>
 
 This library is free software; you can redistribute it and/or
 modify it under the terms of the GNU Library General Public
 License as published by the Free Software Foundation; either
 version 2 of the License, or (at your option) any later version.
 
 This library is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 Library General Public License for more details.
 
 You should have received a copy of the GNU Library General Public License
 along with this library; see the file COPYING.LIB.  If not, write to
 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 Boston, MA 02110-1301, USA.
 */
 #ifndef KOFILTEREDGE_H
 #define KOFILTEREDGE_H
 
 #include "KoFilterChain.h"
 #include "PriorityQueue_p.h"
 
 namespace CalligraFilter {
 /**
  * An internal class representing a filter (=edge) in the filter graph.
  * @internal
  */
 class Edge
 {
 
 public:
     // creates a new edge to "vertex" with the given weight.
     Edge(Vertex* vertex, KoFilterEntry::Ptr filterEntry);
     ~Edge() {}
 
     unsigned int weight() const {
         return m_filterEntry ? m_filterEntry->weight : 0;
     }
     KoFilterEntry::Ptr filterEntry() const {
         return m_filterEntry;
     }
     const Vertex* vertex() const {
         return m_vertex;
     }
 
     // Relaxes the "connected" vertex (i.e. the weight of the
     // connected vertex = "predec.->key()" (parameter) + weight of this edge
     // As this will only be called once we calculate the weight
     // of the edge "on the fly"
     // Note: We have to pass the queue as we have to call keyDecreased :}
     void relax(const Vertex* predecessor, PriorityQueue<Vertex>& queue);
 
     // debugging
     void dump(const QByteArray& indent) const;
 
 private:
     Edge(const Edge& rhs);
     Edge& operator=(const Edge& rhs);
 
     Vertex* m_vertex;
     KoFilterEntry::Ptr m_filterEntry;
 
     class Private;
     Private * const d;
 };
 }
 
 #endif // KOFILTEREDGE_H