Lines Matching refs:NodeId

29     typedef unsigned NodeId;
33 static NodeId invalidNodeId() {
34 return std::numeric_limits<NodeId>::max();
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
124 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
138 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
155 void disconnectFrom(Graph &G, NodeId NId) {
164 NodeId getN1Id() const { return NIds[0]; }
165 NodeId getN2Id() const { return NIds[1]; }
169 NodeId NIds[2];
179 typedef std::vector<NodeId> FreeNodeVector;
190 NodeEntry& getNode(NodeId NId) { return Nodes[NId]; }
191 const NodeEntry& getNode(NodeId NId) const { return Nodes[NId]; }
196 NodeId addConstructedNode(const NodeEntry &N) {
197 NodeId NId = 0;
238 NodeItr(NodeId CurNId, const Graph &G)
246 NodeId operator*() const { return CurNId; }
249 NodeId findNextInUse(NodeId NId) const {
258 NodeId CurNId, EndNId;
357 NodeId addNode(OtherVectorT Costs) {
360 NodeId NId = addConstructedNode(NodeEntry(AllocatedCosts));
371 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) {
389 AdjEdgeIdSet adjEdgeIds(NodeId NId) { return AdjEdgeIdSet(getNode(NId)); }
403 void setNodeCosts(NodeId NId, OtherVectorT Costs) {
413 const Vector& getNodeCosts(NodeId NId) const {
417 NodeMetadata& getNodeMetadata(NodeId NId) {
421 const NodeMetadata& getNodeMetadata(NodeId NId) const {
425 typename NodeEntry::AdjEdgeList::size_type getNodeDegree(NodeId NId) const {
456 NodeId getEdgeNode1Id(EdgeId EId) {
463 NodeId getEdgeNode2Id(EdgeId EId) {
471 NodeId getEdgeOtherNodeId(EdgeId EId, NodeId NId) {
484 EdgeId findEdge(NodeId N1Id, NodeId N2Id) {
496 void removeNode(NodeId NId) {
536 void disconnectEdge(EdgeId EId, NodeId NId) {
546 void disconnectAllNeighborsFromNode(NodeId NId) {
555 void reconnectEdge(EdgeId EId, NodeId NId) {
598 NodeId N1Id = getEdgeNode1Id(EId);
599 NodeId N2Id = getEdgeNode2Id(EId);