MCPcopy Create free account

hub / github.com/apache/commons-graph / functions

Functions838 in github.com/apache/commons-graph

MethodgetEdges
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:214
MethodgetEdges
()
src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java:98
MethodgetElement
Returns the adapted element by this node. @return the adapted element by this node.
src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java:125
MethodgetInDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:59
MethodgetInDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:117
MethodgetInbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:48
MethodgetInbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/DirectedMutableGraph.java:101
MethodgetInbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:109
MethodgetInterface
getInterface This returns the marker interface which is associated with the Contract. For instance, AcyclicContract will return AcyclicGraph here.
base/src/main/java/org/apache/commons/graph/contract/Contract.java:48
MethodgetInterface
Gets the interface attribute of the AcyclicContract object
base/src/main/java/org/apache/commons/graph/contract/AcyclicContract.java:125
MethodgetMaximum
Returns the category maximum points. @return the category maximum points.
src/main/java/org/apache/commons/graph/elo/Category.java:33
MethodgetMinimum
Returns the category minimum points. @return the category minimum points.
src/main/java/org/apache/commons/graph/elo/Category.java:40
MethodgetOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:136
MethodgetOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseGraph.java:194
MethodgetOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:125
MethodgetOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:222
MethodgetOrder
()
src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java:106
MethodgetOutDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:81
MethodgetOutDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:141
MethodgetOutbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:70
MethodgetOutbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/DirectedMutableGraph.java:117
MethodgetOutbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:133
MethodgetParent
Returns the reference to the parent node, if any. @return the reference to the parent node, if any.
src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java:145
MethodgetRanking
( String player )
src/test/java/org/apache/commons/graph/elo/SimplePlayersRank.java:31
MethodgetSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:147
MethodgetSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseGraph.java:202
MethodgetSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:149
MethodgetSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:230
MethodgetSize
()
src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java:111
MethodgetSource
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:238
MethodgetTarget
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:246
MethodgetVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:158
MethodgetVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseGraph.java:210
MethodgetVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:157
MethodgetVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:254
MethodgetWeight
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledWeightedEdge.java:72
MethodgetWeight
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryWeightedPath.java:116
MethodgetWeight
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/MutableSpanningTree.java:84
MethodhashCode
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledEdge.java:73
MethodhashCode
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledWeightedEdge.java:80
MethodhashCode
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledVertex.java:72
MethodhashCode
()
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:177
MethodhashCode
{@inheritDoc}
src/main/java/org/apache/commons/graph/VertexPair.java:98
MethodhashCode
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryWeightedPath.java:124
MethodhashCode
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:270
Methodidentity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigDecimalWeightBaseOperations.java:61
Methodidentity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/FloatWeightBaseOperations.java:57
Methodidentity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/LongWeightBaseOperations.java:57
Methodidentity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/DoubleWeightBaseOperations.java:56
Methodidentity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigIntegerWeightBaseOperations.java:61
Methodidentity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/IntegerWeightBaseOperations.java:57
MethodincludingAllVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/connectivity/DefaultConnectivityBuilder.java:52
MethodincludingVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/connectivity/DefaultConnectivityBuilder.java:60
Methodinverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigDecimalWeightBaseOperations.java:69
Methodinverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/FloatWeightBaseOperations.java:65
Methodinverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/LongWeightBaseOperations.java:65
Methodinverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/DoubleWeightBaseOperations.java:64
Methodinverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigIntegerWeightBaseOperations.java:69
Methodinverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/IntegerWeightBaseOperations.java:65
Methoditerator
{@inheritDoc}
src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java:434
Methodkills
( Vertex v )
base/src/test/java/org/apache/commons/graph/algorithm/dataflow/MockDataFlowEq.java:45
Methodmap
( BaseLabeledWeightedEdge<W> edge )
src/test/java/org/apache/commons/graph/model/BaseWeightedEdge.java:32
Methodmap
( BaseLabeledVertex input )
src/test/java/org/apache/commons/graph/export/VertexLabelMapper.java:31
Methodmap
( BaseLabeledWeightedEdge<Double> input )
src/test/java/org/apache/commons/graph/export/EdgeWeightMapper.java:31
Methodmap
( BaseLabeledWeightedEdge<Double> input )
src/test/java/org/apache/commons/graph/export/EdgeLabelMapper.java:31
Methodmap
( EdgeWrapper<WE> input )
src/main/java/org/apache/commons/graph/flow/DefaultMaxFlowAlgorithmSelector.java:80
Methodmap
( BaseLabeledWeightedEdge<Double> input )
src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java:85
Methodmap
( BaseLabeledWeightedEdge<Double> input )
src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java:65
MethodonCompleted
{@inheritDoc}
src/test/java/org/apache/commons/graph/visit/NodeSequenceVisitor.java:50
MethodonCompleted
{@inheritDoc}
src/main/java/org/apache/commons/graph/connectivity/ConnectedComponentHandler.java:58
MethodonCompleted
{@inheritDoc}
src/main/java/org/apache/commons/graph/visit/VisitGraphBuilder.java:74
MethodonCompleted
{@inheritDoc}
src/main/java/org/apache/commons/graph/visit/BaseGraphVisitHandler.java:91
Methodperform
Applies the classical Kosaraju's algorithm to find the strongly connected components. @return the input graph strongly connected component.
src/main/java/org/apache/commons/graph/scc/KosarajuSharirAlgorithm.java:108
Methodperform
Tarjan's algorithm is a variation (slightly faster) on KosarajuSharir's algorithm for finding strongly-connected components in a directed graph. @ret
src/main/java/org/apache/commons/graph/scc/TarjanAlgorithm.java:109
Methodperform
()
src/main/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowAlgorithm.java:101
Methodpotential
The potential of Fibonacci heap {@code H} is then defined by {@code t(H) + 2m(H)}. @return The potential of this Fibonacci heap.
src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java:617
MethodremoveEdge
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/Contract.java:71
MethodremoveEdge
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/AcyclicContract.java:170
MethodremoveEdge
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedMutableGraph.java:70
MethodremoveEdge
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java:142
MethodremoveVertex
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/Contract.java:77
MethodremoveVertex
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/AcyclicContract.java:165
MethodremoveVertex
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedMutableGraph.java:81
MethodremoveVertex
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java:156
MethodretainAll
{@inheritDoc}
src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java:656
Methodrun
()
src/test/java/org/apache/commons/graph/utils/TestRunner.java:31
MethodrunTest
()
src/test/java/org/apache/commons/graph/model/BaseMutableGraphTestCase.java:64
MethodsetImpl
The impl that gets passed in is read-only. This is the representation of the graph you should work off of. If an edge or vertex addition is illegal to
base/src/main/java/org/apache/commons/graph/contract/Contract.java:41
MethodsetRank
Sets a new different rank. @param rank the new rank to this node.
src/main/java/org/apache/commons/graph/collections/DisjointSetNode.java:117
MethodsetUp
The JUnit setup method
base/src/test/java/org/apache/commons/graph/contract/DAGTest.java:51
MethodsetUp
()
src/test/java/org/apache/commons/graph/shortestpath/BidirDijkstraTestCase.java:64
MethodsetUp
()
src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java:53
MethodsetUp
()
src/test/java/org/apache/commons/graph/export/ExportTestCase.java:38
MethodsetUp
()
src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java:77
MethodsetUp
()
src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java:55
MethodsetUp
()
src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java:59
MethodsetUp
The JUnit setup method
dependency/src/test/java/org/apache/commons/graph/domain/dependency/DependencyTest.java:50
MethodstartGraph
( String name )
src/main/java/org/apache/commons/graph/export/GraphMLExporter.java:186
MethodstartGraph
( String name )
src/main/java/org/apache/commons/graph/export/DotExporter.java:144
MethodstartSerialization
()
src/main/java/org/apache/commons/graph/export/GraphMLExporter.java:198
← previousnext →501–600 of 838, ranked by callers