|
Graph 2
|
#include <graph.h>
Public Member Functions | |
| graph (const std::string &file_name) | |
| Reads edges for graph from file. More... | |
| graph (graph const &org)=default | |
| graph & | operator= (graph const &rhs)=default |
| std::vector< std::vector< unsigned int > > | get_node2nodes () const |
| size_t | Nedges () const |
| size_t | Nvertices () const |
| size_t | Max_vertex () const |
Friends | |
| std::ostream & | operator<< (std::ostream &s, graph const &rhs) |
A better graph class that doesn't requires a consecutive numbering of the vertices.
| graph::graph | ( | const std::string & | file_name | ) |
Reads edges for graph from file.
If the file file_name does not exist then the code stops with an appropriate message.
A consecutive numbering of the vertices is required.
| [in] | file_name | name of the ASCII-file |
|
default |
| vector< vector< unsigned int > > graph::get_node2nodes | ( | ) | const |
Determines the neighboring vertices for each node from the edge definition. The node itself is not contained in the neighboring vertices.
Definition at line 42 of file graph.cpp.


|
inline |
|
inline |
|
inline |
|
friend |