MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
-
- $Id$
+ You should have received a copy of the GNU General Public License along
+ with this program; if not, write to the Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/* We need to generate two trees from the graph:
node_t *n;
connection_t *c;
- cp();
-
/* Clear MST status on connections */
for(node = connection_tree->head; node; node = node->next) {
list_node_t *lnode, *nnode;
bool indirect;
- cp();
-
todo_list = list_alloc(NULL);
ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Running Dijkstra's algorithm:");
list_node_t *from, *todonext;
bool indirect;
- cp();
-
todo_list = list_alloc(NULL);
/* Clear visited status on nodes */
n->status.reachable = !n->status.reachable;
if(n->status.reachable) {
- ifdebug(TRAFFIC) logger(LOG_DEBUG, _("Node %s (%s) became reachable"),
+ ifdebug(TRAFFIC) logger(LOG_DEBUG, "Node %s (%s) became reachable",
n->name, n->hostname);
} else {
- ifdebug(TRAFFIC) logger(LOG_DEBUG, _("Node %s (%s) became unreachable"),
+ ifdebug(TRAFFIC) logger(LOG_DEBUG, "Node %s (%s) became unreachable",
n->name, n->hostname);
}
free(envp[i]);
subnet_update(n, NULL, n->status.reachable);
- }
- }
-}
-
-/* Dump nodes and edges to a graphviz file.
-
- The file can be converted to an image with
- dot -Tpng graph_filename -o image_filename.png -Gconcentrate=true
-*/
-int dump_graph(struct evbuffer *out) {
- splay_node_t *node;
- node_t *n;
- edge_t *e;
-
- if(evbuffer_add_printf(out, "digraph {\n") == -1)
- return errno;
-
- /* dump all nodes first */
- for(node = node_tree->head; node; node = node->next) {
- n = node->data;
- if(evbuffer_add_printf(out, " %s [label = \"%s\"];\n",
- n->name, n->name) == -1)
- return errno;
- }
-
- /* now dump all edges */
- for(node = edge_weight_tree->head; node; node = node->next) {
- e = node->data;
- if(evbuffer_add_printf(out, " %s -> %s;\n",
- e->from->name, e->to->name) == -1)
- return errno;
+ if(!n->status.reachable)
+ update_node_udp(n, NULL);
+ }
}
-
- if(evbuffer_add_printf(out, "}\n") == -1)
- return errno;
-
- return 0;
}
void graph(void) {
- subnet_cache_flush();
+ subnet_cache_flush();
sssp_dijkstra();
check_reachability();
mst_kruskal();