GraphUtil.h File Reference

#include "DataFormats/Math/interface/Graph.h"
#include "DataFormats/Math/interface/GraphWalker.h"
#include <iostream>
#include <string>

Go to the source code of this file.

Functions
template<class N , class E >
void	graph_combine (const math::Graph< N, E > &g1, const math::Graph< N, E > &g2, const N &n1, const N &n2, const N &root, math::Graph< N, E > &result)
template<class N , class E >
void	graph_tree_output (const math::Graph< N, E > &g, const N &root, std::ostream &os)
template<class N , class E >
void	output (const math::Graph< N, E > &g, const N &root)

Function Documentation

template<class N , class E >

void graph_combine	(	const math::Graph< N, E > &	g1,
		const math::Graph< N, E > &	g2,
		const N &	n1,
		const N &	n2,
		const N &	root,
		math::Graph< N, E > &	result
	)

Definition at line 22 of file GraphUtil.h.

References math::Graph< N, E >::addEdge(), math::GraphWalker< N, E >::current(), plotBeamSpotDB::first, diffTwoXMLs::g1, N, math::GraphWalker< N, E >::next(), math::Graph< N, E >::nodeData(), class-composition::parent, math::Graph< N, E >::replace(), and math::GraphWalker< N, E >::stack().

{
  result = g1;
  result.replace(n1,n2);
  math::GraphWalker<N,E> walker(g2,n2);
  while (walker.next()) {
    const N & parent = g2.nodeData((++walker.stack().rbegin())->first->first);
    result.addEdge(parent, walker.current().first, walker.current().second);
  }
  result.replace(n2,root);              
}       

template<class N , class E >

void graph_tree_output	(	const math::Graph< N, E > &	g,
		const N &	root,
		std::ostream &	os
	)

Definition at line 37 of file GraphUtil.h.

References math::GraphWalker< N, E >::current(), particleFlowClusterECALTimeSelected_cfi::depth, math::GraphWalker< N, E >::firstChild(), math::GraphWalker< N, E >::nextSibling(), math::GraphWalker< N, E >::parent(), alignCSCRings::s, math::GraphWalker< N, E >::stack(), AlCaHLTBitMon_QueryRunRegistry::string, and w.

{
  math::GraphWalker<N,E> w(g,root);
  bool go=true;
  unsigned int depth=0;
  while (go) {
    std::string s(2*depth,' ');
    os << ' ' << s << w.current().first << '(' << w.current().second << ')' << std::endl;
    go = w.firstChild();
    if( go ) {
      ++depth;
    }
    else if(w.stack().size() >1 && w.nextSibling()) {
      go=true;
    }
    else {
      go=false;
      while(w.parent()) {
    --depth;
    if (w.stack().size()>1 && w.nextSibling()) {
      go=true;
      break;
    }
      }
    }
  }
}

template<class N , class E >

void output	(	const math::Graph< N, E > &	g,
		const N &	root
	)

Definition at line 10 of file GraphUtil.h.

References gather_cfg::cout, math::GraphWalker< N, E >::current(), math::GraphWalker< N, E >::next(), and w.

{
  math::GraphWalker<N,E> w(g,root);
  bool go=true;
  while(go) {
    std::cout << w.current().first << ' ';
    go=w.next();
  }
  std::cout << std::endl;
}