|
NuriKit v0.1.0b2
|
#include "nuri/core/container/container_ext.h"#include "nuri/core/graph/traits.h"#include "nuri/iterator.h"#include "nuri/meta.h"#include "nuri/utils.h"

Go to the source code of this file.
Classes | |
| class | nuri::Graph< NT, ET > |
| Class for very sparse graphs, especially designed for the molecular graphs. More... | |
| struct | nuri::Graph< NT, ET >::StoredEdge |
Namespaces | |
| namespace | nuri |
Typedefs | |
| using | nuri::NodesErased |
Functions | |
| template<class GT, bool is_const> | |
| internal::EigenNeighborIndexer< GT, is_const > | nuri::as_index (internal::NodeWrapper< GT, is_const > node) |
| template<class NT, class ET> | |
| absl::flat_hash_set< int > | nuri::connected_components (const Graph< NT, ET > &g, int begin) |
| Find connected components of a graph starting from a node. | |
| template<class NT, class ET> | |
| absl::flat_hash_set< int > | nuri::connected_components (const Graph< NT, ET > &g, int begin, int exclude) |
| Find connected components of a graph starting from a node, excluding an edge between the starting node and the excluded node (if present). | |