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