|
GEDLIB
1.0
|
Simple graph class used for communication with user. More...
#include <common_types.hpp>
Public Attributes | |
| std::size_t | id |
| Internal ID of the graph. | |
| std::size_t | num_nodes |
The number of nodes. Nodes have IDs between 0 and num_nodes - 1. | |
| std::size_t | num_edges |
| The number of edges. | |
| std::vector< UserNodeID > | original_node_ids |
| The original IDs of all nodes. | |
| std::vector< UserNodeLabel > | node_labels |
| The labels of all nodes. | |
| std::vector< std::vector< std::size_t > > | adj_matrix |
| Adjacency matrix. | |
| std::map< std::pair< std::size_t, std::size_t >, UserEdgeLabel > | edge_labels |
A hash map with a key-value pair ((internal_tail_id, internal_head_id), label) for each edge. | |
Simple graph class used for communication with user.
| UserNodeID | Class of user-specific node IDs. |
| UserNodeLabel | Class of user-specific node labels. If nodes are unlabeled, use ged::NoLabel or define your own dummy label class. |
| UserEdgeLabel | Class of user-specific edge labels. If edges are unlabeled, use ged::NoLabel or define your own dummy label class. |
Definition at line 332 of file common_types.hpp.
1.8.13