#include <gecko.hpp>
|
| Graph (uint nodes=0) |
|
uint | nodes () const |
|
uint | edges () const |
|
Node::Index | insert_node (Float length=1) |
|
Arc::Index | node_begin (Node::Index i) const |
|
Arc::Index | node_end (Node::Index i) const |
|
uint | node_degree (Node::Index i) const |
|
std::vector< Node::Index > | node_neighbors (Node::Index i) const |
|
Arc::Index | insert_arc (Node::Index i, Node::Index j, Float w=1, Float b=1) |
|
bool | remove_arc (Arc::Index a) |
|
bool | remove_arc (Node::Index i, Node::Index j) |
|
bool | remove_edge (Node::Index i, Node::Index j) |
|
Arc::Index | arc_index (Node::Index i, Node::Index j) const |
|
Node::Index | arc_source (Arc::Index a) const |
|
Node::Index | arc_target (Arc::Index a) const |
|
Float | arc_weight (Arc::Index a) const |
|
Arc::Index | reverse_arc (Arc::Index a) const |
|
void | order (Functional *functional, uint iterations=1, uint window=2, uint period=2, uint seed=0, Progress *progress=0) |
|
const std::vector< Node::Index > & | permutation () const |
|
Node::Index | permutation (uint rank) const |
|
uint | rank (Node::Index i) const |
|
Float | cost () const |
|
Arc::Index | directed () const |
|
Definition at line 621 of file gecko.hpp.
◆ Graph() [1/2]
Gecko::Graph::Graph |
( |
uint |
nodes = 0 | ) |
|
|
inline |
◆ Graph() [2/2]
Gecko::Graph::Graph |
( |
uint |
nodes, |
|
|
uint |
level |
|
) |
| |
|
inlineprotected |
◆ arc_index()
◆ arc_source()
◆ arc_target()
◆ arc_weight()
◆ coarsen()
Graph * Graph::coarsen |
( |
| ) |
|
|
protected |
◆ cost() [1/2]
Float Graph::cost |
( |
| ) |
const |
◆ cost() [2/2]
◆ directed()
◆ edges()
uint Gecko::Graph::edges |
( |
| ) |
const |
|
inline |
◆ insert_arc()
◆ insert_node()
◆ length() [1/2]
◆ length() [2/2]
◆ node_begin()
◆ node_degree()
◆ node_end()
◆ node_neighbors()
◆ nodes()
uint Gecko::Graph::nodes |
( |
| ) |
const |
|
inline |
◆ optimize()
void Graph::optimize |
( |
uint |
n | ) |
|
|
protected |
◆ order()
◆ permutation() [1/2]
const std::vector<Node::Index>& Gecko::Graph::permutation |
( |
| ) |
const |
|
inline |
◆ permutation() [2/2]
◆ persistent()
◆ place() [1/2]
void Graph::place |
( |
bool |
sort = false | ) |
|
|
protected |
◆ place() [2/2]
void Graph::place |
( |
bool |
sort, |
|
|
uint |
k, |
|
|
uint |
n |
|
) |
| |
|
protected |
◆ placed()
◆ rank()
◆ refine()
void Graph::refine |
( |
const Graph * |
graph | ) |
|
|
protected |
◆ relax()
void Graph::relax |
( |
bool |
compatible, |
|
|
uint |
m = 1 |
|
) |
| |
|
protected |
◆ remove_arc() [1/2]
◆ remove_arc() [2/2]
◆ remove_edge()
◆ reverse_arc()
◆ reweight()
void Graph::reweight |
( |
uint |
i | ) |
|
|
protected |
◆ shuffle()
void Graph::shuffle |
( |
uint |
seed = 0 | ) |
|
|
protected |
◆ vcycle()
void Graph::vcycle |
( |
uint |
n, |
|
|
uint |
work = 0 |
|
) |
| |
|
protected |
◆ Drawing
◆ Subgraph
◆ adj
◆ bond
std::vector<Float> Gecko::Graph::bond |
|
protected |
◆ functional
◆ node
std::vector<Node> Gecko::Graph::node |
|
protected |
◆ perm
◆ progress
◆ weight
std::vector<Float> Gecko::Graph::weight |
|
protected |
The documentation for this class was generated from the following files: