This is just memo for Graph before implementing.
This is 1st idea for implementing Graph.
This version has no idea for checking intersection.
Just Data structure......
HashMap
ID : Integer(Long.......actuary)
WaitingList : ArrayList
WaitingList
element(1)
This is 1st idea for implementing Graph.
This version has no idea for checking intersection.
Just Data structure......
HashMap
ID : Integer(Long.......actuary)
WaitingList : ArrayList
WaitingList
element(1)
Comments
I changed as following.
The deeper element has after element list. This list has direct connected node to current list.
Graph
+WaitingGraph
+ GraphElement
........ I have cheep naming sense....ToT
I deleted GraphElemant. I insert after the element instead of GraphElement. It has no relation between before element and after element on the before version. This version can check easy from top down.