Graphs.SynchronizedNode

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total678 of 6780%12 of 120%47471621624141
getEnteringEdgeSet()440%20%229911
getLeavingEdgeSet()440%20%229911
getNeighborNodeIterator()440%20%229911
getBreadthFirstIterator(boolean)410%20%229911
getDepthFirstIterator(boolean)400%20%229911
getEdgeSet()360%20%227711
getEdge(int)180%n/a114411
getEnteringEdge(int)180%n/a114411
getLeavingEdge(int)180%n/a114411
getEdgeBetween(String)180%n/a114411
getEdgeBetween(Node)180%n/a114411
getEdgeBetween(int)180%n/a114411
getEdgeFrom(String)180%n/a114411
getEdgeFrom(Node)180%n/a114411
getEdgeFrom(int)180%n/a114411
getEdgeToward(String)180%n/a114411
getEdgeToward(Node)180%n/a114411
getEdgeToward(int)180%n/a114411
hasEdgeBetween(String)140%n/a114411
hasEdgeBetween(Node)140%n/a114411
hasEdgeBetween(int)140%n/a114411
hasEdgeFrom(String)140%n/a114411
hasEdgeFrom(Node)140%n/a114411
hasEdgeFrom(int)140%n/a114411
hasEdgeToward(String)140%n/a114411
hasEdgeToward(Node)140%n/a114411
hasEdgeToward(int)140%n/a114411
getDegree()130%n/a114411
getInDegree()130%n/a114411
getOutDegree()130%n/a114411
Graphs.SynchronizedNode(Graphs.SynchronizedGraph, Node)120%n/a114411
getBreadthFirstIterator()40%n/a111111
getDepthFirstIterator()40%n/a111111
getEdgeIterator()40%n/a111111
getEnteringEdgeIterator()40%n/a111111
getLeavingEdgeIterator()40%n/a111111
iterator()40%n/a111111
getEachEdge()30%n/a111111
getEachEnteringEdge()30%n/a111111
getEachLeavingEdge()30%n/a111111
getGraph()30%n/a111111