Lines Matching defs:mGraph
41 private final SimpleArrayMap<T, ArrayList<T>> mGraph = new SimpleArrayMap<>();
54 if (!mGraph.containsKey(node)) {
55 mGraph.put(node, null);
63 return mGraph.containsKey(node);
76 if (!mGraph.containsKey(node) || !mGraph.containsKey(incomingEdge)) {
81 ArrayList<T> edges = mGraph.get(node);
85 mGraph.put(node, edges);
98 return mGraph.get(node);
110 for (int i = 0, size = mGraph.size(); i < size; i++) {
111 ArrayList<T> edges = mGraph.valueAt(i);
116 result.add(mGraph.keyAt(i));
130 for (int i = 0, size = mGraph.size(); i < size; i++) {
131 ArrayList<T> edges = mGraph.valueAt(i);
143 for (int i = 0, size = mGraph.size(); i < size; i++) {
144 ArrayList<T> edges = mGraph.valueAt(i);
149 mGraph.clear();
166 for (int i = 0, size = mGraph.size(); i < size; i++) {
167 dfs(mGraph.keyAt(i), mSortResult, mSortTmpMarked);
184 final ArrayList<T> edges = mGraph.get(node);
200 return mGraph.size();
