#include <decomp.h>
Public Member Functions | |
DecompGraph () | |
Standard-Constructor. | |
DecompGraph (const SparsityInfo &si) | |
virtual | ~DecompGraph () |
map< int, Node >::iterator | add_node (int index, int weight=0) |
set< Edge >::iterator | add_edge (map< int, Node >::iterator node1, map< int, Node >::iterator node2, int weight=0) |
set< Edge >::iterator | add_edge (int node1, int node2, int weight=0) |
int | n () const |
The number of nodes. | |
int | m () const |
The number of edges. | |
void | compute_connected_components () |
void | get_component_members (vector< list< int > > &members) |
void | compute_partition (int nparts) |
Public Attributes | |
map< int, Node > | nodes |
set< Edge > | edges |
int | nrcomp |
int | largest_size |
The size of the largest component. | |
Friends | |
ostream & | operator<< (ostream &out, const DecompGraph &g) |
Prints the graph. | |
Classes | |
class | Edge |
class | Node |
Definition at line 14 of file decomp.h.
DecompGraph::DecompGraph | ( | ) | [inline] |
DecompGraph::DecompGraph | ( | const SparsityInfo & | si | ) |
map<int, Node>::iterator DecompGraph::add_node | ( | int | index, | |
int | weight = 0 | |||
) |
set<Edge>::iterator DecompGraph::add_edge | ( | map< int, Node >::iterator | node1, | |
map< int, Node >::iterator | node2, | |||
int | weight = 0 | |||
) |
set<Edge>::iterator DecompGraph::add_edge | ( | int | node1, | |
int | node2, | |||
int | weight = 0 | |||
) |
int DecompGraph::n | ( | ) | const [inline] |
int DecompGraph::m | ( | ) | const [inline] |
void DecompGraph::compute_connected_components | ( | ) |
void DecompGraph::get_component_members | ( | vector< list< int > > & | members | ) |
void DecompGraph::compute_partition | ( | int | nparts | ) |
ostream& operator<< | ( | ostream & | out, | |
const DecompGraph & | g | |||
) | [friend] |
Prints the graph.
out | The ostream to print to. | |
g | The DecompGraph to print. |
map<int, Node> DecompGraph::nodes |
set<Edge> DecompGraph::edges |