29 virtual string key(
void) = 0;
44 string toString(
bool showVertexAddresses=
false);
47 vector<Vertex *> getDownstreamVerticesInternal(
Vertex *vertex);
48 int getLongestDownstreamPathInternal(
Vertex *vertex);
49 static vector<Vertex *> getReachableVertices(
Vertex *vertex,
const map<
Vertex *, vector<Vertex *> > &edges, set<Vertex *> &cycleVertices);
51 map< Vertex *, vector<Vertex *> > edges;
52 map< Vertex *, vector<Vertex *> > downstreamVerticesCache;
53 map< Vertex *, vector<Vertex *> > upstreamVerticesCache;
54 bool cycleVerticesCacheReady;
55 set<Vertex *> cycleVerticesCache;
56 map< Vertex *, int > longestDownstreamPathsCache;
57 std::mutex graphMutex;
71 vector<VuoDirectedAcyclicGraph::Vertex *>
findVertex(
const string &key);
75 string toString(
bool showVertexAddresses=
false);
80 map< VuoDirectedAcyclicGraph *, vector<VuoDirectedAcyclicGraph *> > edges;