|
| | 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.