51 std::map<ObjectId, std::unordered_set<ObjectId>>
mEdges;
std::set< ObjectId > OtherVertices
std::map< ObjectId, std::unordered_set< ObjectId > > mEdges
std::map< ObjectId, int > mXCoordinate
DirectedAcyclicGraph * pDAG
void minimizeEdgeCrossings()
std::set< ObjectId > & getOtherVertices()
std::vector< std::vector< ObjectId > > mNodeLayers
size_t OtherVerticesSize()
std::map< ObjectId, int > mLayers
std::set< ObjectId > mVertices
void constructHierarchy()
AutoLayoutDAG(DirectedAcyclicGraph *dag)
std::vector< ObjectId > & layer(size_t l)
std::map< ObjectId, std::unordered_set< ObjectId > > mReverseEdges
Graph class represents a directed graph.
This is an implementation of AdditiveCCD based on peridyno.