# Obtaining graph relationships of filters and connections ?

**URL:** https://discourse.vtk.org/t/obtaining-graph-relationships-of-filters-and-connections/7536
**Category:** Support
**Created:** [December 31, 2021, 1:49am UTC](https://discourse.vtk.org/t/obtaining-graph-relationships-of-filters-and-connections/7536 "2021-12-31T01:49:03Z")
**Posts on this page:** 1
**Page:** 1

<div class="post-metadata">

### Author: ![Nicholas\_Yue](https://discourse.vtk.org/user_avatar/discourse.vtk.org/nicholas_yue/32/3751_2.png) [@Nicholas\_Yue](https://discourse.vtk.org/u/Nicholas_Yue)
#### Post date: [December 31, 2021, 1:49am UTC](https://discourse.vtk.org/t/obtaining-graph-relationships-of-filters-and-connections/7536/1 "2021-12-31T01:49:03Z")

</div>

In the C++ api, after creating various filters and connecting them is there some API or mechanism to find out the `graph` of the connections and hopefully find the leaf/sink nodes where calling Update() will exercise the graph/pipeline ?

Cheers