Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/apache/commons-graph
/ functions
Functions
838 in github.com/apache/commons-graph
⨍
Functions
838
◇
Types & classes
179
Method
getEdges
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:214
Method
getEdges
()
src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java:98
Method
getElement
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
Method
getInDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:59
Method
getInDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:117
Method
getInbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:48
Method
getInbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/DirectedMutableGraph.java:101
Method
getInbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:109
Method
getInterface
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
Method
getInterface
Gets the interface attribute of the AcyclicContract object
base/src/main/java/org/apache/commons/graph/contract/AcyclicContract.java:125
Method
getMaximum
Returns the category maximum points. @return the category maximum points.
src/main/java/org/apache/commons/graph/elo/Category.java:33
Method
getMinimum
Returns the category minimum points. @return the category minimum points.
src/main/java/org/apache/commons/graph/elo/Category.java:40
Method
getOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:136
Method
getOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseGraph.java:194
Method
getOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:125
Method
getOrder
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:222
Method
getOrder
()
src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java:106
Method
getOutDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:81
Method
getOutDegree
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:141
Method
getOutbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedDirectedGraph.java:70
Method
getOutbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/DirectedMutableGraph.java:117
Method
getOutbound
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:133
Method
getParent
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
Method
getRanking
( String player )
src/test/java/org/apache/commons/graph/elo/SimplePlayersRank.java:31
Method
getSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:147
Method
getSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseGraph.java:202
Method
getSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:149
Method
getSize
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:230
Method
getSize
()
src/main/java/org/apache/commons/graph/spanning/ReverseDeleteGraph.java:111
Method
getSource
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:238
Method
getTarget
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:246
Method
getVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:158
Method
getVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseGraph.java:210
Method
getVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/RevertedGraph.java:157
Method
getVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:254
Method
getWeight
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledWeightedEdge.java:72
Method
getWeight
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryWeightedPath.java:116
Method
getWeight
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/MutableSpanningTree.java:84
Method
hashCode
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledEdge.java:73
Method
hashCode
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledWeightedEdge.java:80
Method
hashCode
{@inheritDoc}
src/test/java/org/apache/commons/graph/model/BaseLabeledVertex.java:72
Method
hashCode
()
src/main/java/org/apache/commons/graph/SynchronizedGraph.java:177
Method
hashCode
{@inheritDoc}
src/main/java/org/apache/commons/graph/VertexPair.java:98
Method
hashCode
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryWeightedPath.java:124
Method
hashCode
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/InMemoryPath.java:270
Method
identity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigDecimalWeightBaseOperations.java:61
Method
identity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/FloatWeightBaseOperations.java:57
Method
identity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/LongWeightBaseOperations.java:57
Method
identity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/DoubleWeightBaseOperations.java:56
Method
identity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigIntegerWeightBaseOperations.java:61
Method
identity
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/IntegerWeightBaseOperations.java:57
Method
includingAllVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/connectivity/DefaultConnectivityBuilder.java:52
Method
includingVertices
{@inheritDoc}
src/main/java/org/apache/commons/graph/connectivity/DefaultConnectivityBuilder.java:60
Method
inverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigDecimalWeightBaseOperations.java:69
Method
inverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/FloatWeightBaseOperations.java:65
Method
inverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/LongWeightBaseOperations.java:65
Method
inverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/DoubleWeightBaseOperations.java:64
Method
inverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/BigIntegerWeightBaseOperations.java:69
Method
inverse
{@inheritDoc}
src/main/java/org/apache/commons/graph/weight/primitive/IntegerWeightBaseOperations.java:65
Method
iterator
{@inheritDoc}
src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java:434
Method
kills
( Vertex v )
base/src/test/java/org/apache/commons/graph/algorithm/dataflow/MockDataFlowEq.java:45
Method
map
( BaseLabeledWeightedEdge<W> edge )
src/test/java/org/apache/commons/graph/model/BaseWeightedEdge.java:32
Method
map
( BaseLabeledVertex input )
src/test/java/org/apache/commons/graph/export/VertexLabelMapper.java:31
Method
map
( BaseLabeledWeightedEdge<Double> input )
src/test/java/org/apache/commons/graph/export/EdgeWeightMapper.java:31
Method
map
( BaseLabeledWeightedEdge<Double> input )
src/test/java/org/apache/commons/graph/export/EdgeLabelMapper.java:31
Method
map
( EdgeWrapper<WE> input )
src/main/java/org/apache/commons/graph/flow/DefaultMaxFlowAlgorithmSelector.java:80
Method
map
( BaseLabeledWeightedEdge<Double> input )
src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java:85
Method
map
( BaseLabeledWeightedEdge<Double> input )
src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java:65
Method
onCompleted
{@inheritDoc}
src/test/java/org/apache/commons/graph/visit/NodeSequenceVisitor.java:50
Method
onCompleted
{@inheritDoc}
src/main/java/org/apache/commons/graph/connectivity/ConnectedComponentHandler.java:58
Method
onCompleted
{@inheritDoc}
src/main/java/org/apache/commons/graph/visit/VisitGraphBuilder.java:74
Method
onCompleted
{@inheritDoc}
src/main/java/org/apache/commons/graph/visit/BaseGraphVisitHandler.java:91
Method
perform
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
Method
perform
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
Method
perform
()
src/main/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowAlgorithm.java:101
Method
potential
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
Method
removeEdge
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/Contract.java:71
Method
removeEdge
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/AcyclicContract.java:170
Method
removeEdge
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedMutableGraph.java:70
Method
removeEdge
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java:142
Method
removeVertex
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/Contract.java:77
Method
removeVertex
Description of the Method
base/src/main/java/org/apache/commons/graph/contract/AcyclicContract.java:165
Method
removeVertex
{@inheritDoc}
src/main/java/org/apache/commons/graph/SynchronizedMutableGraph.java:81
Method
removeVertex
{@inheritDoc}
src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java:156
Method
retainAll
{@inheritDoc}
src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java:656
Method
run
()
src/test/java/org/apache/commons/graph/utils/TestRunner.java:31
Method
runTest
()
src/test/java/org/apache/commons/graph/model/BaseMutableGraphTestCase.java:64
Method
setImpl
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
Method
setRank
Sets a new different rank. @param rank the new rank to this node.
src/main/java/org/apache/commons/graph/collections/DisjointSetNode.java:117
Method
setUp
The JUnit setup method
base/src/test/java/org/apache/commons/graph/contract/DAGTest.java:51
Method
setUp
()
src/test/java/org/apache/commons/graph/shortestpath/BidirDijkstraTestCase.java:64
Method
setUp
()
src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java:53
Method
setUp
()
src/test/java/org/apache/commons/graph/export/ExportTestCase.java:38
Method
setUp
()
src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java:77
Method
setUp
()
src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java:55
Method
setUp
()
src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java:59
Method
setUp
The JUnit setup method
dependency/src/test/java/org/apache/commons/graph/domain/dependency/DependencyTest.java:50
Method
startGraph
( String name )
src/main/java/org/apache/commons/graph/export/GraphMLExporter.java:186
Method
startGraph
( String name )
src/main/java/org/apache/commons/graph/export/DotExporter.java:144
Method
startSerialization
()
src/main/java/org/apache/commons/graph/export/GraphMLExporter.java:198
← previous
next →
501–600 of 838, ranked by callers