<div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div><p>I don't understand this function:<br></p><p></p>
<blockquote style="border-left:1px solid rgb(204, 204, 204);margin:0pt 0pt 0pt 0.8ex;padding-left:1ex" class="gmail_quote"><p>void vtkGraph::AddEdgePoint (vtkIdType e, double x[3]) <br></p><p>Adds a point to the end of the list of edge points for a certain edge..</p>
</blockquote><p></p><p>is an edge allowed to have more than 2 points?</p></div></blockquote><div>"edge points" are only for extra points in an edge (e.g. to make curved/routed edges). When converted to lines, edges always start/end at the vertex location. What you are looking for is vtkGraph::GetPoints(), which returns a vtkPoints structure that contains the locations of each vertex.</div>
<div><br></div><div>You may want to look at the classes ending with "LayoutStrategy" under Infovis. These are modules that can be plugged into vtkGraphLayout.</div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div><p></p><p>Also, is there a min cut / max flow function?</p></div></blockquote></div>There is not currently a VTK algorithm for it, but you can use a vtkGraph as an input to any Boost algorithm by including "vtkBoostGraphAdapter.h". The Boost Graph Library does contain a min cut / max flow algorithm. See the implementation of some filters like vtkBoostBreadthFirstSearch for an idea of how to adapt a vtkGraph to Boost.<br>
<div><br></div><div>Jeff</div>