#include <WhiteheadGraph.h>
Inheritance diagram for WhiteheadSimpleGraph:
Public Member Functions | |
WhiteheadSimpleGraph (const Word &w, int num_of_gens) | |
Constructor. | |
~WhiteheadSimpleGraph () | |
int | getCount (int i, int j) const |
Get the label of the edge (i,j). | |
int | getSize () const |
Get the number of vertices of the graph. | |
vector< double > | getWeightVector () const |
Get a vector containing weights of the edges of the graph. | |
vector< Word > | getWeightNames () const |
Get a vector of words, corresponding to edges of the graph. | |
bool | isUndirected () const |
Check if undirected graph. | |
void | makeUndirected () |
Convert to undirected Whitehead graph. | |
int | numberOfComponents () const |
Get the number of connected components. | |
int | numberOfCutVertices () const |
Get the number of cut vertices (articulation points). | |
vector< int > | cutVertices () const |
Get the list of cut vertices (articulation points). | |
int | numberOfCutVerticesBruteForce () const |
vector< int > | cutVerticesBruteForce () const |
Private Member Functions | |
void | printOn (ostream &out) const |
Outputs the graph into a stream. | |
int | genToIndex (const Generator &g) const |
Transfers a letter into a graph vertex. | |
Generator | indToGenerator (int i) const |
Transfers a vertex into the corresponding letter. | |
int | nOfComponents () const |
computes the number of connected components | |
Private Attributes | |
int | theSize |
The number of vertices. | |
int ** | theAdjMatrix |
The adjacensy matrix of the graph. | |
bool | undirected |
True if undirected. | |
Friends | |
ostream & | operator<< (ostream &out, const WhiteheadSimpleGraph &g) |
Output operator. |
Definition at line 155 of file WhiteheadGraph.h.
|
Constructor.
|
|
|
|
Get the list of cut vertices (articulation points).
|
|
|
|
Transfers a letter into a graph vertex.
Definition at line 246 of file WhiteheadGraph.h. References WhiteheadGraph::nOfGenerators. |
|
Get the label of the edge (i,j).
The label is the number of times (counts) the subword
Definition at line 180 of file WhiteheadGraph.h. References msgs::error(), theAdjMatrix, and theSize. |
|
Get the number of vertices of the graph.
Definition at line 190 of file WhiteheadGraph.h. References theSize. |
|
Get a vector of words, corresponding to edges of the graph.
|
|
Get a vector containing weights of the edges of the graph.
|
|
Transfers a vertex into the corresponding letter.
Definition at line 255 of file WhiteheadGraph.h. References WhiteheadGraph::nOfGenerators. |
|
Check if undirected graph. By default the graph is undirected Whitehead graph. Run makeUndirected() to convert to undirected graph.
Definition at line 210 of file WhiteheadGraph.h. References undirected. |
|
Convert to undirected Whitehead graph. Initially a Directed Whitehead graph is constructed. Use this function to convert to undirected Whitehead graph.
Edges are added, and the new edge weights |
|
computes the number of connected components
|
|
Get the number of connected components.
|
|
Get the number of cut vertices (articulation points).
|
|
|
|
Outputs the graph into a stream.
|
|
Output operator.
Definition at line 167 of file WhiteheadGraph.h. |
|
The adjacensy matrix of the graph.
Definition at line 272 of file WhiteheadGraph.h. Referenced by getCount(). |
|
The number of vertices.
Definition at line 269 of file WhiteheadGraph.h. Referenced by getCount(), and getSize(). |
|
True if undirected.
Definition at line 275 of file WhiteheadGraph.h. Referenced by isUndirected(). |