network

[Complex Humans]

I have a little problem,
that i'd like to read your comments and suggestions
I create a network of 5-10 nodes - a weighted digraph
which all nodes are connected randomly at runtime.
Loops are allowed in the graph.
Is it possible to *hash* pairs of nodes
as well as their costs by use of the following snip,


template<typename T>
struct HashNodes{
T startNode;
T endNode;
int weight[];
};

This is clumpsy and possibly won't work
but I am clueless as of where should I go

 

[=?iso-8859-1?q?Erik_Wikstr=F6m?=]

I have a little problem,
that i'd like to read your comments and suggestions
I create a network of 5-10 nodes - a weighted digraph
which all nodes are connected randomly at runtime.
Loops are allowed in the graph.
Is it possible to *hash* pairs of nodes
as well as their costs by use of the following snip,

template<typename T>
struct HashNodes{
T startNode;
T endNode;
int weight[];

};

This is clumpsy and possibly won't work
but I am clueless as of where should I go

Do I understand you correctly that you want a way to quickly get the
weight given two nodes? In that case I would use
std::map<std:air<Node, Node>, double> and create a functor which
given two std:aid<Node, Node> orders them in some way (on other way
implements a less than function for pairs of std:aid<Node, Node>.
Exactly how this is done is not particularly important, and if you
have some ID for each node there should be no problem.

 

[=?ISO-8859-1?Q?Erik_Wikstr=F6m?=]

I have a little problem,
that i'd like to read your comments and suggestions
I create a network of 5-10 nodes - a weighted digraph
which all nodes are connected randomly at runtime.
Loops are allowed in the graph.
Is it possible to *hash* pairs of nodes
as well as their costs by use of the following snip,

template<typename T>
struct HashNodes{
T startNode;
T endNode;
int weight[];

};

This is clumpsy and possibly won't work
but I am clueless as of where should I go

Do I understand you correctly that you want a way to quickly get the
weight given two nodes? In that case I would use
std::map<std:air<Node, Node>, double> and create a functor which
given two std:aid<Node, Node> orders them in some way (on other way
implements a less than function for pairs of std:aid<Node, Node>.

Hmm, not even I can parse the last bit of that. What I meant was to say
that you should implement a 'less than' function so that you can compare
two std:air<Node, Node> objects and tell which of them is the
smallest, for some definition of smallest.