- findAllCutVertices(Graph<V, E>) - Method in class graph.properties.splitting.Splitting
-
Finds a list of graph's cut vertices
A cut vertex is a vertex whose removal would disconnect the remaining graph
- findAllCycles() - Method in class graph.algorithm.cycles.SimpleUndirectedCyclesFinder
-
Finds all cycles of a graph.
- findAllPathsDFS(Graph<V, E>, V, V) - Static method in class graph.traversal.GraphTraversal
-
Finds all paths in the given graph between two provided vertices using depth-first search
- findAllPathsDFS(Graph<V, E>, V, V, List<V>) - Static method in class graph.traversal.GraphTraversal
-
Finds all paths in the given graph between two provided vertices not containing any of vertices in the given list using depth-first search
- findAllPathsDFS(V, V) - Method in class graph.trees.dfs.DFSTree
-
Finds all paths between the given two vertices using DFS
- findAllPathsDFSContaining(Graph<V, E>, V, V, List<V>) - Static method in class graph.traversal.GraphTraversal
-
Finds all paths in the given graph between two provided vertices containing a list of vertices using depth-first search
- findAllSplitComponents(Graph<V, E>, SplitPair<V, E>) - Method in class graph.properties.splitting.Splitting
-
- findAllSplitPairs(Graph<V, E>) - Method in class graph.properties.splitting.Splitting
-
Deprecated.
- findAutomorphisms() - Method in class graph.symmetry.nauty.McKayGraphLabelingAlgorithm
-
Finds automorphisms of the graph
- findBiconnectedComponents() - Method in class graph.properties.splitting.BiconnectedSplitting
-
Divides the graph into biconnected components
and return them
- findBottom() - Method in class graph.drawing.Drawing
-
Finds the position of the bottom-most vertex
- findCycles(Graph<V, E>) - Method in class graph.algorithm.cycles.SimpleCyclesFinder
-
Finds cycle basis of the given graph.
- findDihedralGroups() - Method in class graph.symmetry.PermutationAnalyzator
-
Finds permutation's dihedral groups
- findFundamentalCycle(DFSTree<V, E>, E) - Method in class graph.algorithms.planarity.FraysseixMendezPlanarity
-
Implementation of the procedure for finding a fundamental cycle
- findLeavesOf(List<E>) - Method in class graph.tree.pq.PQTree
-
Finds all leaves which are destination or source of the edge
belonging to the provided list
- findLeftmostPosition() - Method in class graph.drawing.Drawing
-
Finds the position of the left-most vertex
- findLongestPath(Graph<V, E>) - Static method in class graph.traversal.GraphTraversal
-
Finds the longest path in a graph
Method should be rewritten to increase its effectiveness
- findMiddle() - Method in class graph.drawing.Drawing
-
Calculates the y value of the center of the drawing
- findReflectionGroups() - Method in class graph.symmetry.PermutationAnalyzator
-
Finds permutation's reflection groups
- findRotationGroups() - Method in class graph.symmetry.PermutationAnalyzator
-
Finds permutation's rotation groups
- findSeaparationPairs(Graph<V, E>) - Method in class graph.properties.splitting.SeparationPairSplitting
-
Finds all separation pairs of the given graph
- findSimpleCycles() - Method in class graph.algorithm.cycles.JohnsonSimpleCycles
-
- findSimpleCycles() - Method in class graph.algorithm.cycles.PatonSimpleCycles
-
- findTop() - Method in class graph.drawing.Drawing
-
Finds the position of the topmost vertex
- fix() - Method in class graph.symmetry.Permutation
-
Finds the fix of the permutation
- fix() - Method in class graph.symmetry.PermutationGroup
-
Finds vertices fixed by the group
- formBackEdges(List<E>) - Method in class graph.trees.dfs.DFSTree
-
Separates back edges
- formCycleGraph(List<V>, Class<?>) - Method in class graph.operations.GraphOperations
-
Forms a cycle from vertices v1...vn in that order
- formDFSTree() - Method in class graph.traversal.DFSTreeTraversal
-
Forms a DFS tree whose root is the first vertex of the associated graph
- formDFSTree(V) - Method in class graph.traversal.DFSTreeTraversal
-
Forms a DFS tree with the given root
- formFaces(V, V) - Method in class graph.algorithms.planarity.PlanarFaces
-
Runs the algorithm for forming planar faces
- formOrder(Graph<V, E>, V, V) - Method in class graph.algorithms.numbering.STNumbering
-
Forms the st-order
- FraysseixMendezPlanarity<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity
-
An algorithm for checking the planarity of a graph based on Fraysseix and Mendez's algorithm
- FraysseixMendezPlanarity() - Constructor for class graph.algorithms.planarity.FraysseixMendezPlanarity
-
- FruchtermanReingoldLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.force.directed
-
Layouter which uses JUNG framework's Fruchterman-Reingold layout
- FruchtermanReingoldLayouter() - Constructor for class graph.layout.force.directed.FruchtermanReingoldLayouter
-
- fullChildrenCount() - Method in class graph.tree.pq.PQTreeNode
-
Only used for P-nodes