data-structures heap priority-queue fibonacci-heap

What is the purpose behind marking some of the nodes in Fibonacci heap?

This picture from Wikipedia article has three nodes of a Fibonacci heap marked in blue . What is the purpose of some of the nodes being marked in this data structure ?

Solution

A node is marked when one of its child nodes is cut because of a decrease-key. When a second child is cut, the node also cuts itself from its parent. Marking is done so that you know when the second cut occurs.

How can I create a two-way mapping in JavaScript, or some other way to swap out values?
What would be a good use-case scenario for the Spliterator in Java 8?
Representing graphs (data structure) in Python
Can someone explain Hoare's partitioning scheme to me?
Can deleting a single node in an AVL tree ever require two double rotations?
post order traversal in binary tree using one stack
Detecting Duplicates Using Divide and Conquer - Merge Sort
Dijkstra's algorithm for directed graph with positive weights and a cycle
Space Complexity of Storing a Binary Representation of an Integer
How to find level order traversal from Preorder and Inorder Traversal
Visual C++ equivalent of GCC's __attribute__ ((__packed__))
I am trying to reverse the stack using recursion. What is being passed in function fun()? s is an object of class stack
Modify 2d array to create nested datasets when specific key is encountered
JS - recursive function on multidimensional array to filter out only "checked" items (and its parents if a child is selected)
Comparing two similar objects (holding same keys) and returning key value pairs that are different
Linked List Replacement Function with Head, Tail, and Size Management
Efficient Array Storage for Binary Tree
How to render data and initialize an UI event handling upon this data after the data has been loaded by an asynchronous API call?
Hackerrank Repeated String infinite loop problem
Using asterisk and spaces print the letter R [ 21*20]
Split a collection into `n` parts with LINQ?
How can I enhance the time complexity of arranging bricks into stacks based on specific conditions?
List-like data-structure with O(1) access in practice but O(N) access for huge sizes; What is it?
Octree implementation in Rust: why is the insert function duplicating insertions and how could I go about fixing this?
Data structures for compiled XPath queries
how to traverse an NxN grid diagonally
Name of binary data structures that contain fixed-length components?
Insert after specific element in LinkedList java
inserting in binary tree doesn't work using java
Generate simple URL patterns from a list of examples