Method initialize

sdk/lowlevel/source/NvBlastFamilyGraph.cpp:101–116

Graph initialization, reset all internal data to initial state. Marks all nodes dirty for this actor. First island search probably would be the longest one, as it has to traverse whole graph and set all the optimization stuff like fastRoute and hopCounts for all nodes. */

First island search probably would be the longest one, as it has to traverse whole graph and set all the optimization stuff like fastRoute and hopCounts for all nodes.
*/
void FamilyGraph::initialize(ActorIndex actorIndex, const SupportGraph* graph)
{
	// used internal data pointers
	NodeIndex* dirtyNodeLinks = getDirtyNodeLinks();
	uint32_t* firstDirtyNodeIndices = getFirstDirtyNodeIndices();

	// link dirty nodes
	for (NodeIndex node = 1; node < graph->m_nodeCount; node++)
	{
		dirtyNodeLinks[node-1] = node;
	}
	firstDirtyNodeIndices[actorIndex] = 0;

	getIsNodeInDirtyList()->fill();
	getIsEdgeRemoved()->clear();
}


void FamilyGraph::addToDirtyNodeList(ActorIndex actorIndex, NodeIndex node)