//C++ TO C# CONVERTER WARNING: 'const' methods are not available in C#:
//ORIGINAL LINE: boost::python::list getOutput() const
public boost::python.list getOutput()
{
boost::python.list o = new boost::python.list();
foreach (Point p in @out)
{
o.append(p);
}
return(new boost::python.list(o));
}
//C++ TO C# CONVERTER WARNING: 'const' methods are not available in C#:
//ORIGINAL LINE: boost::python::list getOutput() const
public boost::python.list getOutput()
{
boost::python.list plist = new boost::python.list();
foreach (boost in :graph_traits <boost::adjacency_matrix <boost::undirectedS, boost::no_property, boost::property <boost::edge_weight_t, double, boost::property <boost::edge_index_t, uint> >, boost::no_property> > .vertex_descriptor v : output)
{
plist.append(v);
}
return(new boost::python.list(plist));
}
// PYTHON
public boost::python.list getVertices()
{
boost::python.list plist = new boost::python.list();
foreach (CLSVertex v in g.vertices())
{
plist.append(g[v].position);
}
return(new boost::python.list(plist));
}
public boost::python.list getEdges()
{
boost::python.list edge_list = new boost::python.list();
foreach (CLSEdge edge in g.edges())
{ // loop through each edge
boost::python.list point_list = new boost::python.list(); // the endpoints of each edge
CLSVertex v1 = g.source(edge);
CLSVertex v2 = g.target(edge);
point_list.append(g[v1].position);
point_list.append(g[v2].position);
edge_list.append(point_list);
}
return(new boost::python.list(edge_list));
}
