Searched refs:NodeEntry (Results 1 – 2 of 2) sorted by relevance
64 class NodeEntry {74 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {} in NodeEntry() function108 ThisEdgeAdjIdxs[0] = NodeEntry::getInvalidAdjEdgeIdx(); in EdgeEntry()109 ThisEdgeAdjIdxs[1] = NodeEntry::getInvalidAdjEdgeIdx(); in EdgeEntry()115 NodeEntry::getInvalidAdjEdgeIdx(); in invalidate()120 assert(ThisEdgeAdjIdxs[NIdx] == NodeEntry::getInvalidAdjEdgeIdx() && in connectToN()122 NodeEntry &N = G.getNode(NIds[NIdx]); in connectToN()140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()150 assert(ThisEdgeAdjIdxs[NIdx] != NodeEntry::getInvalidAdjEdgeIdx() && in disconnectFromN()152 NodeEntry &N = G.getNode(NIds[NIdx]); in disconnectFromN()[all …]
31 class NodeEntry;34 typedef std::list<NodeEntry> NodeList;55 class NodeEntry {62 NodeEntry(const Vector &costs) : costs(costs), degree(0) {} in NodeEntry() function111 NodeEntry& getNode(NodeItr nItr) { return *nItr; } in getNode()112 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; } in getNode()117 NodeItr addConstructedNode(const NodeEntry &n) { in addConstructedNode()128 NodeEntry &n1 = getNode(ne.getNode1()); in addConstructedEdge()129 NodeEntry &n2 = getNode(ne.getNode2()); in addConstructedEdge()169 return addConstructedNode(NodeEntry(costs)); in addNode()[all …]