Searched refs:m_independentNodes (Results 1 – 1 of 1) sorted by relevance
28 private Map<T, Node<T>> m_independentNodes = null; field in Graph41 return m_independentNodes.containsKey(object); in isIndependent()58 m_independentNodes.remove(predecessor); in addPredecessor()59 m_independentNodes.remove(tm); in addPredecessor()89 return m_independentNodes.keySet(); in getIndependentNodes()158 if (null == m_independentNodes) { in initializeIndependentNodes()164 m_independentNodes = Maps.newLinkedHashMap(); in initializeIndependentNodes()166 m_independentNodes.put(node.getObject(), node); in initializeIndependentNodes()