trivial, and that data do not following the shortest path in number of
hops on this graph. Another way to say it is that there is no implicit
in these routing descriptions. The system will only use the routes you
-declare (such as <route src="A" dst="C"><route_element
-name="3"/></route>), without trying to build new routes by aggregating
+declare (such as <route src="A" dst="C"><route_element
+name="3"/></route>), without trying to build new routes by aggregating
the provided ones.
You are also free to declare platform where the routing is not
return xbt_peer_new(h->name,h->port);
}
-/** \brief constructor. Argument should be of form '<peername>:<port>'. */
+/** \brief constructor. Argument should be of form '(peername):(port)'. */
xbt_peer_t xbt_peer_from_string(const char *peerport) {
xbt_peer_t res=xbt_new(s_xbt_peer_t, 1);
char *name=xbt_strdup(peerport);
