Line data    Source code

       1             : /*
       2             :  * Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
       3             :  */
       4             : 
       5             : #include "db/db_graph_vertex.h"
       6             : 
       7             : #include "db/db_graph.h"
       8             : #include "db/db_graph_edge.h"
       9             : 
      10             : using namespace boost;
      11             : 
      12     3706553 : DBGraphVertex::adjacency_iterator::adjacency_iterator()
      13     3706553 :     : graph_(NULL) {
      14     3706553 : }
      15             : 
      16     1141653 : DBGraphVertex::adjacency_iterator::adjacency_iterator(DBGraph *graph,
      17     1141653 :                                                       Vertex vertex)
      18     1141653 :     : graph_(graph) {
      19     1141653 :     boost::tie(iter_, end_) = adjacent_vertices(vertex, *graph_->graph());
      20     1141653 : }
      21             : 
      22     3463478 : DBGraphVertex &DBGraphVertex::adjacency_iterator::dereference() const {
      23     3463478 :     Vertex adj = *iter_;
      24     3463478 :     return *(graph_->vertex_data(adj));
      25             : }
      26             : 
      27     1451618 : DBGraphVertex::edge_iterator::edge_iterator()
      28     1451618 :     : graph_(NULL), vertex_(NULL) {
      29     1451618 : }
      30             : 
      31      360749 : DBGraphVertex::edge_iterator::edge_iterator(DBGraph *graph,
      32      360749 :                                             DBGraphVertex *vertex)
      33      360749 :     : graph_(graph), vertex_(vertex) {
      34      360749 :     boost::tie(iter_, end_) = out_edges(vertex->vertex(), *graph_->graph());
      35      360749 : }
      36             : 
      37     1087908 : DBGraphEdge &DBGraphVertex::edge_iterator::dereference() const {
      38     1087908 :     Edge edge = *iter_;
      39     2175816 :     return *(graph_->edge_data(edge));
      40             : }
      41             : 
      42      288853 : DBGraphVertex *DBGraphVertex::edge_iterator::target() const {
      43      288853 :     Edge descriptor = *iter_;
      44      288853 :     DBGraphEdge *edge = graph_->edge_data(descriptor);
      45      288853 :     DBGraphVertex *v_target = edge->target(graph_);
      46      288853 :     if (v_target == vertex_) {
      47      114893 :         return edge->source(graph_);
      48             :     }
      49      173960 :     return v_target;
      50             : }
      51             : 
      52      108127 : bool DBGraphVertex::HasAdjacencies(DBGraph *graph) const {
      53      108127 :     DBGraphBase::adjacency_iterator iter, end;
      54      108127 :     boost::tie(iter, end) = adjacent_vertices(vertex_id_, *graph->graph());
      55      216254 :     return (iter != end);
      56             : }