- BCNodeType - Enum in graph.tree.bc
-
Types of nodes of BC-trees (B-block and C-cut vertex)
- BCTree<V extends Vertex,E extends Edge<V>> - Class in graph.tree.bc
-
Class represents a block-cut vertex tree and contains methods for its construction given
a separable graph
Let B be the set of blocks and C be the set of cut vertices of a separable graph G.
- BCTree(Graph<V, E>) - Constructor for class graph.tree.bc.BCTree
-
Constructs the BC-tree of the specified graph
- BCTreeEdge - Class in graph.tree.bc
-
Edge of the block-cut vertex tree
- BCTreeEdge(BCTreeNode, BCTreeNode) - Constructor for class graph.tree.bc.BCTreeEdge
-
Construct a BC-tree edge with the specified origina and destination nodes
- BCTreeNode - Class in graph.tree.bc
-
Node of the block-cut vertex tree
- BCTreeNode(BCNodeType, Object) - Constructor for class graph.tree.bc.BCTreeNode
-
Construct the BC-tree node of the specified type and with the given content
- BCTreeNode(Object) - Constructor for class graph.tree.bc.BCTreeNode
-
Construct the BC-tree node with the given content
- BiconnectedSplitting<V extends Vertex,E extends Edge<V>> - Class in graph.properties.splitting
-
Finds all biconnected components of a graph
efficiently, by using the depth-first search
Since the components should have the same features as block
Like removal of vertex which also removed the edge, being able to find its cut vertices etc.
- BiconnectedSplitting(Graph<V, E>) - Constructor for class graph.properties.splitting.BiconnectedSplitting
-
- binaryRepresenatation(List<V>) - Method in class graph.symmetry.nauty.BinaryRepresentation
-
Finds the binary representation of the graph given a list of its vertices
- BinaryRepresentation<V extends Vertex,E extends Edge<V>> - Class in graph.symmetry.nauty
-
Binary representation of a graph, used in graph labeling algorithm
- BinaryRepresentation(Graph<V, E>) - Constructor for class graph.symmetry.nauty.BinaryRepresentation
-
- BinaryTree<V extends Vertex,E extends Edge<V>> - Class in graph.tree.binary
-
A binary tree and methods for its construction
- BinaryTree(Graph<V, E>) - Constructor for class graph.tree.binary.BinaryTree
-
Tried to construct the binary tree given a graph
- BinaryTreeNode<V extends Vertex> - Class in graph.tree.binary
-
Node of the binary tree
- BinaryTreeNode(V) - Constructor for class graph.tree.binary.BinaryTreeNode
-
Constructs a binary tree node associated with the given vertex
- BinaryTreeNode(V, BinaryTreeNode<V>, BinaryTreeNode<V>) - Constructor for class graph.tree.binary.BinaryTreeNode
-
Construct a binary tree node associated with the given vertex
and sets nodes to its right and left
- BinaryTreeNode(V, BinaryTreeNode<V>, BinaryTreeNode<V>, BinaryTreeNode<V>) - Constructor for class graph.tree.binary.BinaryTreeNode
-
Construct a binary tree node associated with the given vertex
and sets nodes to its right and left as well as its parent
- Bipartite<V extends Vertex,E extends Edge<V>> - Class in graph.properties
-
A class for checking the bipartite property of a graph
Bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V
(that is, U and V are each independent sets) such that every edge connects a vertex in U to one in V.
- Bipartite(Graph<V, E>) - Constructor for class graph.properties.Bipartite
-
- Block() - Constructor for class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
- Block<V extends Vertex,E extends Edge<V>> - Class in graph.properties.components
-
Class represent a block of a graph.
- Block(Graph<V, E>) - Constructor for class graph.properties.components.Block
-
- BoxLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.box
-
A simple layout algorithm which places elements in a table like structure
Suitable if the elements are not linked
- BoxLayouter() - Constructor for class graph.layout.box.BoxLayouter
-
- BoyerMyrvoldPlanarity<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity
-
Implementation of the Boyer-Myrvold planarity testing algorithm
The Boyer-Myrvold algorithm is a planarity testing algorithm which uses reverse DFS order as numbering
of the vertices of G.
- BoyerMyrvoldPlanarity() - Constructor for class graph.algorithms.planarity.BoyerMyrvoldPlanarity
-
- BoyerMyrvoldPlanarity.Block - Class in graph.algorithms.planarity
-
Represents a block used during the implementation of Boyer-Myrvold algorithm
- bubble(PQTree<V, E>, List<PQTreeNode>) - Method in class graph.tree.pq.PQTreeReduction
-
Implementation of the bubble procedure